Record: found
Abstract: not found
Book Chapter: not found

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

other

Author(s): Bernard Boigelot , Julien Brusten , Jérôme Leroux

Publication date (Print): 2009

Publisher: Springer Berlin Heidelberg

Read this book at

Publisher

Buy book

Bookmark

There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 13

Record: found
Abstract: not found
Article: not found

On the base-dependence of sets of numbers recognizable by finite automata

Alan Cobham (1969)

0 comments Cited 55 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Book Chapter: not found

On the expressiveness of real and integer arithmetic automata

Bernard Boigelot, Stéphane Rassart, Pierre Wolper (1998)

0 comments Cited 19 times – based on 0 reviews

Bookmark

Record: found
Abstract: not found
Article: not found

An effective decision procedure for linear arithmetic over the integers and reals

Pierre Wolper, Sébastien Jodogne, Bernard Boigelot (2005)

0 comments Cited 17 times – based on 0 reviews      Review now

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 2009

Pages: 469-484

DOI: 10.1007/978-3-642-02959-2_34

SO-VID: ad85fe8f-e464-4ad4-b822-68b123958e64

License:

http://www.springer.com/tdm

History

Data availability:

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

Read this book at

Related collections

University of Huddersfield Press

Most cited references 13

On the base-dependence of sets of numbers recognizable by finite automata

On the expressiveness of real and integer arithmetic automata

An effective decision procedure for linear arithmetic over the integers and reals

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 3,516

Cited by 9