Restarting tiling automata

DOI10.1142/S0129054113400236MaRDI QIDQ5401561zbMATH OpenOpenAlexFDO

Authors Daniel Průša, František Mráz

Publication date 10 March 2014

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054113400236

zbMATH Keywords

two-dimensional languagesrestarting automatatiling systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Restarting tiling automata
• A computational model for tiling recognizable two-dimensional languages
• Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
• Extended two-way ordered restarting automata for picture languages
• Ordered restarting automata for picture languages

Cites work

• A computational model for tiling recognizable two-dimensional languages
• One-tape, off-line Turing machine computations
• Picture Languages: From Wang Tiles to 2D Grammars
• SHRINKING RESTARTING AUTOMATA

Cited in

(8)

• Automata with cyclic move operations for picture languages
• Deterministic ordered restarting automata for picture languages
• Strategies to scan pictures with automata based on Wang tiles
• Some classes of rational functions for pictures
• Non-expandable non-overlapping sets of pictures
• Restarting tiling automata
• Ordered restarting automata for picture languages
• Two-dimensional models

This page was built for publication: Restarting tiling automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5401561)