The finiteness of synchronous, tabled picture languages is decidable

DOI10.1016/J.TCS.2006.08.028zbMath1154.68077OpenAlexW2015066171MaRDI QIDQ860893

Bianca Truthe

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.08.028

zbMATH Keywords

finitenessdecidabilityLindenmayer systemschain code picture systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Complexity and decidability for chain code picture languages
• Using string languages to describe picture languages
• Languages of encoded line patterns
• Developments in Language Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The finiteness of synchronous, tabled picture languages is decidable