Regular Growth Automata: Properties of a Class of Finitely Induced Infinite Machines
From MaRDI portal
Recommendations
- On the conditions of regularity for finite autonomous automata
- scientific article; zbMATH DE number 4096786
- 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
Cites work
- Automata Presenting Structures: A Survey of the Finite String Case
- Automaticity. I: Properties of a measure of descriptional complexity
- scientific article; zbMATH DE number 18635 (Why is no real title available?)
- Model-checking \(\mathrm{CTL}^*\) over flat Presburger counter systems
- Synchronized rational relations of finite and infinite words
Cited in
(5)
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)