Two-dimensional jumping finite automata
نویسندگان
چکیده
منابع مشابه
Two-dimensional Jumping Finite Automata
In this paper, we extend a newly introduced concept called the jumping finite automata for accepting string languages to two-dimensional jumping finite automata for accepting two-dimensional languages. We discuss some of the basic properties of these automata and compare the family of languages accepted by these automata with the family of Siromoney matrix languages and also recognizable pictur...
متن کاملFinite State Automata Representing Two-Dimensional Subshifts
A new type of two-dimensional automaton has been defined to recognize a class of twodimensional shifts of finite type having the property that every admissible block found within the related local picture language can be extended to a point of the subshift. Here it is shown that this automaton accurately represents the image of the represented twodimensional shift of finite type under a block c...
متن کاملOn Basic Properties of Jumping Finite Automata
We complete the initial study of jumping finite automata, which was started in a former article of Meduna and Zemek [6]. The open questions about basic closure properties are solved. Besides this, we correct erroneous results presented in the article. Finally, we point out important relations between jumping finite automata and some other models studied in the literature.
متن کاملThree-Way Two-Dimensional Deterministic Finite Automata with Rotated Inputs
Inoue et al. introduced an automaton on a twodimensional tape, which decides acceptance or rejection of an input tape by scanning the tape from various sides by various automata which move one way, and investigated the accepting power of such an automaton. This paper continues the investigation of this type of automata, especially, ∨-type automata (obtained by combining four three-way two-dimen...
متن کاملOn Two-Dimensional Pattern Matching by Finite Automata
This paper presents a general concept of two-dimensional pattern matching using conventional (one-dimensional) finite automata. Then two particular models and methods, implementations of the general principle, are presented. The first of these two models presents an automata based version of the Bird and Baker approach with lower space complexity than the original algorithm. The second introduc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics for Application
سال: 2017
ISSN: 1805-3610,1805-3629
DOI: 10.13164/ma.2016.08