Structural Presburger digit vector automata
From MaRDI portal
Publication:2378536
DOI10.1016/j.tcs.2008.09.037zbMath1155.68045OpenAlexW2011015421MaRDI QIDQ2378536
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
Related Items (1)
Uses Software
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