Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)

DOI10.1007/978-3-540-87531-4_31zbMath1156.03330OpenAlexW1497535273MaRDI QIDQ3540195

Jochen Eisinger

Publication date: 20 November 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-87531-4_31

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30)

Related Items (3)

Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract) ⋮ Ehrenfeucht-Fraïssé goes automatic for real addition ⋮ Uniformly Automatic Classes of Finite Structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computational complexity of logical theories
• On syntactic congruences for \(\omega\)-languages
• Efficient minimization of deterministic weak \(\omega\)-automata
• Theory of computation.
• Applying Linear Quantifier Elimination
• Weak Second‐Order Arithmetic and Finite Automata
• Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)
• An effective decision procedure for linear arithmetic over the integers and reals
• Implementation and Application of Automata
• Don’t Care Words with an Application to the Automata-Based Approach for Real Addition

This page was built for publication: Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)