Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)
DOI10.1007/978-3-540-87531-4_31zbMATH Open1156.03330OpenAlexW1497535273MaRDI QIDQ3540195FDOQ3540195
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
Recommendations
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)
Cites Work
- Theory of computation.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weak Second‐Order Arithmetic and Finite Automata
- On syntactic congruences for \(\omega\)-languages
- Applying Linear Quantifier Elimination
- The computational complexity of logical theories
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient minimization of deterministic weak \(\omega\)-automata
- An effective decision procedure for linear arithmetic over the integers and reals
- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)
- Title not available (Why is that?)
- Ehrenfeucht-Fraïssé goes automatic for real addition
- Implementation and Application of Automata
- Don’t Care Words with an Application to the Automata-Based Approach for Real Addition
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
- Title not available (Why is that?)
- 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)
