• Journal of applied mathematics & informatics
• /
• 제42권3호
• /
• pp.483-497
• /
• 2024

Isometric array grammar is one of the simplest model to generate picture languages, since both sides of its production rule have the same shape. In this paper, we have introduced isometric fuzzy regular array grammars to generate isometric fuzzy regular array languages and discussed its closure properties. Also, the relation between isometric fuzzy regular array grammar and boustrophedon fuzzy finite automata has been discussed. Moreover, we study the relation between two dimensional fuzzy regular grammars with returning fuzzy finite automata and boustrophedon fuzzy finite automata. Further, the hierarchy results of these three classes of languages have been discussed.