scientific article; zbMATH DE number 6841176
From MaRDI portal
Publication:4603446
DOI10.23638/LMCS-14(1:15)2018zbMath1398.68291arXiv1612.08154MaRDI QIDQ4603446
Udi Boker, Dana Fisman, Dana Angluin
Publication date: 20 February 2018
Full work available at URL: https://arxiv.org/abs/1612.08154
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
Learning infinite-word automata with loop-index queries ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Regular \(\omega\)-languages with an informative right congruence ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Space-bounded reducibility among combinatorial problems
- On syntactic congruences for \(\omega\)-languages
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Complementing semi-deterministic Büchi automata
- Learning Regular Omega Languages
- Linear Automaton Transformations
- Weak Second‐Order Arithmetic and Finite Automata
- Learning the Language of Error
- Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique
- Propositional dynamic logic of looping and converse is elementarily decidable
- Synthesis of interface specifications for Java classes
- A Modular Approach for Büchi Determinization.
- Büchi Complementation Made Tight
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- Testing and generating infinite sequences by a finite automaton
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Ultimately periodic words of rational ω-languages
This page was built for publication:
