Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization
From MaRDI portal
Publication:3618581
DOI10.1007/978-3-642-00982-2_17zbMath1234.68084OpenAlexW1550639553MaRDI QIDQ3618581
Bernard Boigelot, Jean-François Degbomont
Publication date: 2 April 2009
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_17
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05)
Cites Work
- A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
- Logic and \(p\)-recognizable sets of integers
- Counting the solutions of Presburger equations without enumerating them.
- An effective decision procedure for linear arithmetic over the integers and reals
- Implementation and Application of Automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization
