Sets of Numbers Defined by Finite Automata

DOI10.2307/2314883zbMath0149.01002OpenAlexW2322424904MaRDI QIDQ5527824

Richard E. Stearns, Juris Hartmanis

Publication date: 1967

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2314883

zbMATH Keywords

mathematical logic

Related Items (8)

Infinite-word languages and continuous mappings ⋮ Decision problems forω-automata ⋮ Automatic Sets of Rational Numbers ⋮ An analogue of Cobham’s theorem for fractals ⋮ Rational and affine expressions for image description ⋮ Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages ⋮ Alternating finite automata on \(\omega\)-words ⋮ A classification of \(\omega\)-regular languages

This page was built for publication: Sets of Numbers Defined by Finite Automata