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

DOI10.1007/978-3-540-87531-4_31MaRDI QIDQ3540195zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Bounds on the automata size for Presburger arithmetic
• An effective decision procedure for linear arithmetic over the integers and reals
• Ehrenfeucht-Fraïssé goes automatic for real addition
• scientific article; zbMATH DE number 1765703
• Ehrenfeucht-Fraïssé goes automatic for real addition

Cites work

• scientific article; zbMATH DE number 3501006 (Why is no real title available?)
• scientific article; zbMATH DE number 612169 (Why is no real title available?)
• scientific article; zbMATH DE number 1007358 (Why is no real title available?)
• scientific article; zbMATH DE number 2090515 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• scientific article; zbMATH DE number 3408928 (Why is no real title available?)
• An effective decision procedure for linear arithmetic over the integers and reals
• Applying Linear Quantifier Elimination
• Don’t Care Words with an Application to the Automata-Based Approach for Real Addition
• Efficient minimization of deterministic weak -automata
• Ehrenfeucht-Fraïssé goes automatic for real addition
• Implementation and Application of Automata
• On syntactic congruences for \(\omega\)-languages
• The computational complexity of logical theories
• Theory of computation.
• Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)
• Weak Second‐Order Arithmetic and Finite Automata

Cited in

(9)

• Ehrenfeucht-Fraïssé goes automatic for real addition
• Ehrenfeucht-Fraïssé goes automatic for real addition
• Don't care words with an application to the automata-based approach for real addition
• Bounds on the automata size for Presburger arithmetic
• Uniformly Automatic Classes of Finite Structures
• scientific article; zbMATH DE number 1765703 (Why is no real title available?)
• Don’t Care Words with an Application to the Automata-Based Approach for Real Addition
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540195)