Families of DFAs as acceptors of -regular languages
From MaRDI portal
Publication:4603446
DOI10.23638/LMCS-14(1:15)2018zbMATH Open1398.68291arXiv1612.08154MaRDI QIDQ4603446FDOQ4603446
Authors: Dana Angluin, Udi Boker, Dana Fisman 
Publication date: 20 February 2018
Full work available at URL: https://arxiv.org/abs/1612.08154
Recommendations
Cites Work
- Title not available (Why is that?)
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Propositional dynamic logic of looping and converse is elementarily decidable
- Weak Second‐Order Arithmetic and Finite Automata
- Synthesis of interface specifications for Java classes
- Tools and Algorithms for the Construction and Analysis of Systems
- On syntactic congruences for \(\omega\)-languages
- Learning regular omega languages
- Title not available (Why is that?)
- Testing and generating infinite sequences by a finite automaton
- Büchi complementation made tight
- Title not available (Why is that?)
- Linear Automaton Transformations
- Space-bounded reducibility among combinatorial problems
- Title not available (Why is that?)
- On the (in)succinctness of Muller automata
- Ultimately periodic words of rational ω-languages
- A modular approach for Büchi determinization
- Learning the Language of Error
- Tools and Algorithms for the Construction and Analysis of Systems
- Families of DFAs as acceptors of \(\omega\)-regular languages
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Complementing semi-deterministic Büchi automata
- Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique
Cited In (9)
- Families of DFAs as Acceptors of omega-Regular Languages
- Title not available (Why is that?)
- Learning infinite-word automata with loop-index queries
- Constructing deterministic parity automata from positive and negative examples
- Families of DFAs as acceptors of \(\omega\)-regular languages
- Regular \(\omega\)-languages with an informative right congruence
- Congruence Relations for Büchi Automata
- Title not available (Why is that?)
- FORQ-Based Language Inclusion Formal Testing
This page was built for publication: Families of DFAs as acceptors of \(\omega\)-regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603446)
