Automata with cyclic move operations for picture languages
From MaRDI portal
Publication:5223618
DOI10.1051/ITA/2018018zbMATH Open1423.68263OpenAlexW2909947511WikidataQ128554820 ScholiaQ128554820MaRDI QIDQ5223618FDOQ5223618
Authors: Friedrich Otto, František Mráz 
Publication date: 18 July 2019
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ita/2018018
Recommendations
Cites Work
- Title not available (Why is that?)
- Growing context-sensitive languages and Church-Rosser languages
- Complexity of two-dimensional patterns
- Restarting tiling automata
- Monotonicity of restarting automata
- One-tape, off-line Turing machine computations
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
- Matrix-based complexity functions and recognizable picture languages
- Title not available (Why is that?)
- Restarting tiling automata
- Ordered restarting automata for picture languages
- Two-dimensional sgraffito automata
- Two-dimensional Sgraffito automata
- New results on deterministic sgraffito automata
- Comparing two-dimensional one-marker automata to sgraffito automata
- Extended two-way ordered restarting automata for picture languages
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
- Deterministic ordered restarting automata for picture languages
- Scanning pictures the boustrophedon way
- Some classes of rational functions for pictures
Cited In (2)
This page was built for publication: Automata with cyclic move operations for picture languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223618)
