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

DOI10.1007/978-3-642-23211-4_12zbMATH Open1348.68111OpenAlexW34992031MaRDI QIDQ3172836FDOQ3172836

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

Recommendations

• On the conditions of regularity for finite autonomous automata
• scientific article
• Regularity and size of set automata
• scientific article; zbMATH DE number 3915652
• Generalized automata on infinite trees and Muller-McNaughton's theorem
• Growth of action graphs of finite automata
• Rationality of the growth functions of initial Mealy automata
• scientific article; zbMATH DE number 3390659
• On a subclass of \(\infty\)-regular languages
• scientific article; zbMATH DE number 3983141

Mathematics Subject Classification ID

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

Cites Work

• Automata Presenting Structures: A Survey of the Finite String Case
• Model-checking CTL* over flat Presburger counter systems
• Automaticity. I: Properties of a measure of descriptional complexity
• Synchronized rational relations of finite and infinite words
• Title not available (Why is that?)

Cited In (3)

• Automata recognition in effectively defined classes
• On a subclass of \(\infty\)-regular languages
• Title not available (Why is that?)

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

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