Structural Presburger digit vector automata

DOI10.1016/j.tcs.2008.09.037zbMath1155.68045OpenAlexW2011015421MaRDI QIDQ2378536

Jérôme Leroux

Publication date: 8 January 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.09.037

zbMATH Keywords

automatonPresburger arithmetic

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

How to Tackle Integer Weighted Automata Positivity

Uses Software

• FAST
• LASH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Logic and \(p\)-recognizable sets of integers
• The definable criterion for definability in Presburger arithmetic and its applications.
• Semigroups, Presburger formulas, and languages
• Bounds on the automata size for Presburger arithmetic
• Computer Aided Verification
• Efficient Symbolic Representations for Arithmetic Constraints in Verification
• Diophantine equations, Presburger arithmetic and finite automata
• Perspectives of System Informatics

This page was built for publication: Structural Presburger digit vector automata