On Complexity of Two Dimensional Languages Generated by Transducers
From MaRDI portal
Publication:3602813
DOI10.1007/978-3-540-70844-5_19zbMATH Open1172.68502OpenAlexW1592502832MaRDI QIDQ3602813FDOQ3602813
Authors: 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
Recommendations
- Expressiveness and complexity of regular pure two-dimensional context-free languages
- Classes of two-dimensional languages and recognizability conditions
- A stronger recognizability condition for two-dimensional languages
- Comparing necessary conditions for recognizability of two-dimensional languages
- scientific article; zbMATH DE number 7770055
- scientific article; zbMATH DE number 7770057
- Recognition and complexity results for projection languages of two-dimensional automata
- Complexity of two-dimensional rank-reducing grammars
- On Some Classes of 2D Languages and Their Relations
- The complexity of some decision problems about two-dimensional array grammars
Cites Work
- Title not available (Why is that?)
- An Introduction to Symbolic Dynamics and Coding
- Automorphisms of compact groups
- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
- Finite State Automata Representing Two-Dimensional Subshifts
- A small aperiodic set of Wang tiles
- Unambiguous recognizable two-dimensional languages
- Matrix-based complexity functions and recognizable picture languages
- Title not available (Why is that?)
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
- Title not available (Why is that?)
- TRANSITIVITY IN TWO-DIMENSIONAL LOCAL LANGUAGES DEFINED BY DOT SYSTEMS
- Title not available (Why is that?)
- Theory Is Forever
- Aspects of Molecular Computing
Cited In (8)
- TRANSITIVITY IN TWO-DIMENSIONAL LOCAL LANGUAGES DEFINED BY DOT SYSTEMS
- Non-recursive Trade-offs between Two-Dimensional Automata and Grammars
- Two-dimensional rational automata: a bridge unifying one- and two-dimensional language theory
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
- Transducer generated arrays of robotic nano-arms
- Complexity of two-dimensional rank-reducing grammars
- On Some Classes of 2D Languages and Their Relations
- Two-dimensional languages and cellular automata
This page was built for publication: On Complexity of Two Dimensional Languages Generated by Transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602813)
