Article

On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract)

Authors:

Bernard Boigelot,

Stéphane Rassart,

Pierre WolperAuthors Info & Claims

ICALP '98: Proceedings of the 25th International Colloquium on Automata, Languages and Programming

Pages 152 - 163

Published: 13 July 1998 Publication History

Abstract

No abstract available.

Cited By

View all

D'Osualdo EMeyer RZetzsche GKoskinen EGrohe MShankar N(2016)First-order logic with reachability for infinite-state systemsProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/2933575.2934552(457-466)Online publication date: 5-Jul-2016
https://dl.acm.org/doi/10.1145/2933575.2934552
Rigo M(2010)Numeration systemsProceedings of the 14th international conference on Developments in language theory10.5555/1881463.1881470(33-53)Online publication date: 17-Aug-2010
https://dl.acm.org/doi/10.5555/1881463.1881470
Legay AWolper P(2010)On (Omega-)regular model checkingACM Transactions on Computational Logic10.1145/1838552.183855412:1(1-46)Online publication date: 26-Nov-2010
https://dl.acm.org/doi/10.1145/1838552.1838554
Show More Cited By

On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract)
1. Theory of computation
  1. Models of computation
    1. Concurrency

Recommendations

Extended symbolic finite automata and transducers

Symbolic finite automata and transducers augment classic automata and transducers with symbolic alphabets represented as parametric theories. This extension enables to succinctly represent large and potentially infinite alphabets while preserving ...
Finite Substitutions and Integer Weighted Finite Automata
Bounds on the automata size for Presburger arithmetic

Automata provide a decision procedure for Presburger arithmetic. However, until now only crude lower and upper bounds were known on the sizes of the automata produced by the automata-based approach for Presburger arithmetic. In this article, we give an ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ICALP '98: Proceedings of the 25th International Colloquium on Automata, Languages and Programming

July 1998

928 pages

ISBN:3540647813

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 13 July 1998

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

D'Osualdo EMeyer RZetzsche GKoskinen EGrohe MShankar N(2016)First-order logic with reachability for infinite-state systemsProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/2933575.2934552(457-466)Online publication date: 5-Jul-2016
https://dl.acm.org/doi/10.1145/2933575.2934552
Rigo M(2010)Numeration systemsProceedings of the 14th international conference on Developments in language theory10.5555/1881463.1881470(33-53)Online publication date: 17-Aug-2010
https://dl.acm.org/doi/10.5555/1881463.1881470
Legay AWolper P(2010)On (Omega-)regular model checkingACM Transactions on Computational Logic10.1145/1838552.183855412:1(1-46)Online publication date: 26-Nov-2010
https://dl.acm.org/doi/10.1145/1838552.1838554
Klaedtke F(2008)Bounds on the automata size for Presburger arithmeticACM Transactions on Computational Logic (TOCL)10.1145/1342991.13429959:2(1-34)Online publication date: 7-Apr-2008
https://dl.acm.org/doi/10.1145/1342991.1342995
Boigelot BBrusten JBruyère V(2008)On the Sets of Real Numbers Recognized by Finite Automata in Multiple BasesProceedings of the 35th international colloquium on Automata, Languages and Programming, Part II10.1007/978-3-540-70583-3_10(112-123)Online publication date: 7-Jul-2008
https://dl.acm.org/doi/10.1007/978-3-540-70583-3_10
Leroux J(2008)Convex Hull of Arithmetic AutomataProceedings of the 15th international symposium on Static Analysis10.1007/978-3-540-69166-2_4(47-61)Online publication date: 16-Jul-2008
https://dl.acm.org/doi/10.1007/978-3-540-69166-2_4
Boigelot BBrusten J(2007)A generalization of Cobham's theorem to automata over real numbersProceedings of the 34th international conference on Automata, Languages and Programming10.5555/2394539.2394635(813-824)Online publication date: 9-Jul-2007
https://dl.acm.org/doi/10.5555/2394539.2394635
Anderson SRevesz P(2005)Verifying the incorrectness of programs and automataProceedings of the 6th international conference on Abstraction, Reformulation and Approximation10.1007/11527862_1(1-13)Online publication date: 26-Jul-2005
https://dl.acm.org/doi/10.1007/11527862_1
Dang Z(2003)Pushdown timed automataTheoretical Computer Science10.1016/S0304-3975(02)00743-0302:1-3(93-121)Online publication date: 13-Jun-2003
https://dl.acm.org/doi/10.1016/S0304-3975%2802%2900743-0
Blumensath AGrädel E(2000)Automatic StructuresProceedings of the 15th Annual IEEE Symposium on Logic in Computer Science10.5555/788022.789015Online publication date: 26-Jun-2000
https://dl.acm.org/doi/10.5555/788022.789015

View Options

View options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Recommendations

Extended symbolic finite automata and transducers

Finite Substitutions and Integer Weighted Finite Automata

Bounds on the automata size for Presburger arithmetic

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations