A Generalization of Cobham’s Theorem to Automata over Real Numbers

DOI10.1007/978-3-540-73420-8_70zbMath1171.68522OpenAlexW2134207638MaRDI 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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (3)

On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases ⋮ Cobham's theorem for substitutions ⋮ Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order

This page was built for publication: A Generalization of Cobham’s Theorem to Automata over Real Numbers