scientific article; zbMATH DE number 7104929
From MaRDI portal
Publication:5232903
zbMath1434.68210arXiv1802.04739MaRDI QIDQ5232903
Dana Fisman, Timos Antonopoulos, Dana Angluin
Publication date: 13 September 2019
Full work available at URL: https://arxiv.org/abs/1802.04739
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational learning theory (68Q32) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)
Related Items
Cites Work
- Learning regular omega languages
- Learning regular sets from queries and counterexamples
- Automata, logics, and infinite games. A guide to current research
- On the learnability of infinitary regular sets
- Queries and concept learning
- Relating word and tree automata
- On Determinisation of Good-for-Games Automata
- Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
- Learning of Regular ω-Tree Languages
- Nondeterminism in the Presence of a Diverse or Unknown Future
- An automata-theoretic approach to branching-time model checking
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
