A Generalization of Cobham’s Theorem to Automata over Real Numbers
From MaRDI portal
Publication:5428861
DOI10.1007/978-3-540-73420-8_70zbMath1171.68522MaRDI QIDQ5428861
Bernard Boigelot, Julien Brusten
Publication date: 28 November 2007
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73420-8_70
68Q45: Formal languages and automata
03D05: Automata and formal grammars in connection with logical questions
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Cobham's theorem for substitutions, Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order, On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases