A generalization of Cobham's theorem to automata over real numbers
type: Item
instance of: scholarly article
title: A generalization of Cobham's theorem to automata over real numbers
zbMATH Open document ID: 1172.68029
author: B. Boigelot
author: Julien Brusten
published in: Theoretical Computer Science
publication date: 2009-04-29T00:00:00Z
full work available at URL: http://orbi.ulg.ac.be/handle/2268/34584
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03D05
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 5549392
zbMATH Keywords: automata
zbMATH Keywords: real numbers
zbMATH Keywords: mixed real-integer arithmetic
zbMATH Keywords: Cobham's theorem
MaRDI profile type: Publication
OpenAlex ID: W2140093467
cites work: Quantifier elimination for the reals with a predicate for the powers of two
cites work: An effective decision procedure for linear arithmetic over the integers and reals
cites work: Counting the solutions of Presburger equations without enumerating them.
cites work: Q4219027
cites work: Logic and \(p\)-recognizable sets of integers
cites work: Q5525343
cites work: On the base-dependence of sets of numbers recognizable by finite automata
cites work: Tools and Algorithms for the Construction and Analysis of Systems
cites work: Efficient minimization of deterministic weak \(\omega\)-automata
cites work: Presburgerness of predicates regular in two number systems
cites work: The field of reals with a predicate for the powers of two
cites work: The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable
cites work: Q4281563
DOI: 10.1016/J.TCS.2008.12.051
description: scientific article; zbMATH DE number 5549392