Certifying DFA bounds for recognition and separation
From MaRDI portal
Publication:2147179
DOI10.1007/978-3-030-88885-5_4zbMATH Open1497.68273arXiv2107.01566OpenAlexW3210219611MaRDI QIDQ2147179FDOQ2147179
Authors: Orna Kupferman, Nir Lavee, Salomon Sickert 
Publication date: 22 June 2022
Abstract: The automation of decision procedures makes certification essential. We suggest to use determinacy of turn-based two-player games with regular winning conditions in order to generate certificates for the number of states that a deterministic finite automaton (DFA) needs in order to recognize a given language. Given a language and a bound , recognizability of by a DFA with states is reduced to a game between Prover and Refuter. The interaction along the game then serves as a certificate. Certificates generated by Prover are minimal DFAs. Certificates generated by Refuter are faulty attempts to define the required DFA. We compare the length of offline certificates, which are generated with no interaction between Prover and Refuter, and online certificates, which are based on such an interaction, and are thus shorter. We show that our approach is useful also for certification of separability of regular languages by a DFA of a given size. Unlike DFA minimization, which can be solved in polynomial time, separation is NP-complete, and thus the certification approach is essential. In addition, we prove NP-completeness of a strict version of separation.
Full work available at URL: https://arxiv.org/abs/2107.01566
Recommendations
- Learning Minimal Separating DFA’s for Compositional Verification
- A simplified lower bound for context-free-language recognition
- A lower bound for the nondeterministic space complexity of context-free recognition
- Exact DFA Identification Using SAT Solvers
- Recognition of tractable DNFs representable by a constant number of intervals
- Upper bounds on recognition of a hierarchy of non-context-free languages
- Efficient algorithms for the inference of minimum size DFAs
- A sufficient condition to polynomially compute a minimum separating DFA
- The recognition of deterministic CFLs in small time and space
- scientific article; zbMATH DE number 3958761
Cites Work
- Learning regular sets from queries and counterexamples
- Separating regular languages with first-order logic
- Title not available (Why is that?)
- Complexity of automaton identification from given data
- Computing minimal separating DFAs and regular invariants using SAT and SMT solvers
- Efficient separability of regular languages by subsequences and suffixes
- State Reduction in Incompletely Specified Finite-State Machines
- Exact DFA Identification Using SAT Solvers
- Model checking of safety properties
- Tools and Algorithms for the Construction and Analysis of Systems
- Recognizing safety and liveness
- Solving Sequential Conditions by Finite-State Strategies
- Linear Automaton Transformations
- Certifying inexpressibility
- Inferring regular languages and \(\omega\)-languages
- Beyond hyper-minimisation -- minimising DBAs and DPAs is NP-complete
- Regular separability of well-structured transition systems
- Fixing the state budget: approximation of regular languages with small DFAs
Cited In (2)
This page was built for publication: Certifying DFA bounds for recognition and separation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147179)
