Sets of Numbers Defined by Finite Automata
From MaRDI portal
Cited in
(8)- A classification of \(\omega\)-regular languages
- Infinite-word languages and continuous mappings
- Rational and affine expressions for image description
- Theory of -languages. I: Characterizations of -context- free languages
- Automatic sets of rational numbers
- An analogue of Cobham’s theorem for fractals
- Decision problems forω-automata
- Alternating finite automata on -words
This page was built for publication: Sets of Numbers Defined by Finite Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5527824)