On Complexity of Two Dimensional Languages Generated by Transducers
From MaRDI portal
Publication:3602813
DOI10.1007/978-3-540-70844-5_19zbMath1172.68502MaRDI QIDQ3602813
Egor Dolzhenko, Nataša Jonoska
Publication date: 12 February 2009
Published in: Implementation and Applications of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70844-5_19
68Q45: Formal languages and automata
Related Items
Transducer generated arrays of robotic nano-arms, TWO-DIMENSIONAL LANGUAGES AND CELLULAR AUTOMATA, Two-Dimensional Rational Automata: A Bridge Unifying One- and Two-Dimensional Language Theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A small aperiodic set of Wang tiles
- Unambiguous recognizable two-dimensional languages
- Automorphisms of compact groups
- Finite State Automata Representing Two-Dimensional Subshifts
- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
- An Introduction to Symbolic Dynamics and Coding
- TRANSITIVITY IN TWO-DIMENSIONAL LOCAL LANGUAGES DEFINED BY DOT SYSTEMS
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
- Theory Is Forever
- Aspects of Molecular Computing