Regular Growth Automata: Properties of a Class of Finitely Induced Infinite Machines

DOI10.1007/978-3-642-23211-4_12zbMath1348.68111OpenAlexW34992031MaRDI QIDQ3172836

Christian Wurm

Publication date: 7 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23211-4_12

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Linguistics (91F20)

Cites Work

• Unnamed Item
• Synchronized rational relations of finite and infinite words
• Automaticity. I: Properties of a measure of descriptional complexity
• Model-checking CTL* over flat Presburger counter systems
• Automata Presenting Structures: A Survey of the Finite String Case

This page was built for publication: Regular Growth Automata: Properties of a Class of Finitely Induced Infinite Machines