PICTURE PROCESSING ON ISOMETRIC FUZZY REGULAR ARRAY LANGUAGES

Title

PICTURE PROCESSING ON ISOMETRIC FUZZY REGULAR ARRAY LANGUAGES

Creator

John Kaspar A.; Sheena Chiristy D.K.; Thomas D.G.

Description

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. 2024 KSCAM.

Source

Journal of Applied Mathematics and Informatics, Vol-42, No. 3, pp. 483-497.

Date

2024-01-01

Publisher

Korean Society for Computational and Applied Mathematics

Subject

Boustrophedon fuzzy finite automata; isometric regular array grammars; picture languages; two dimensional fuzzy regular languages

Coverage

John Kaspar A., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bengaluru, 560029, India; Sheena Chiristy D.K., Department of Mathematics, Faculty of Engineering and Technology, SRM Institute of Science and Technology, Kattankulathur, Tamilnadu, Chengalpattu, 603 203, India; Thomas D.G., Department of Mathematics, Madras Christian College, Chennai, Tambaram, 600 059, India

Rights

Restricted Access

Relation

ISSN: 27341194

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.14317/jami.2024.483

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85195682510&doi=10.14317%2fjami.2024.483&partnerID=40&md5=a63b0b41673e2580e6cd4ca0373e1ba1