Don’t Care Words with an Application to the Automata-Based Approach for Real Addition
From MaRDI portal
Publication:5756751
DOI10.1007/11817963_10zbMath1188.68185OpenAlexW1679728107MaRDI QIDQ5756751
Jochen Eisinger, Felix Klaedtke
Publication date: 5 September 2007
Published in: Computer Aided Verification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11817963_10
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Mechanizing the Powerset Construction for Restricted Classes of ω-Automata ⋮ On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases ⋮ Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract) ⋮ A Generalization of Semenov’s Theorem to Automata over Real Numbers ⋮ Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints