Constructing concise characteristic samples for acceptors of omega regular languages
From MaRDI portal
Cites work
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- A unified approach for showing language inclusion and equivalence between various types of -automata
- An automata-theoretic approach to branching-time model checking
- An automata-theoretic approach to linear temporal logic
- Beyond hyper-minimisation -- minimising DBAs and DPAs is NP-complete
- Characteristic sets for polynomial grammatical inference
- Complexity of automaton identification from given data
- Computing the Rabin Index of a Parity Automaton
- Constructing deterministic -automata from examples by an extension of the RPNI algorithm
- Depth-First Search and Linear Graph Algorithms
- Elements of automata theory. Translated from the French by Reuben Thomas
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- Families of DFAs as Acceptors of omega-Regular Languages
- Grammatical inference. Learning automata and grammars.
- scientific article; zbMATH DE number 7447748 (Why is no real title available?)
- scientific article; zbMATH DE number 3513696 (Why is no real title available?)
- scientific article; zbMATH DE number 1956591 (Why is no real title available?)
- scientific article; zbMATH DE number 1418458 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- scientific article; zbMATH DE number 7650821 (Why is no real title available?)
- Inferring canonical register automata
- Inferring Symbolic Automata
- Language identification in the limit
- Learning and characterizing fully-ordered lattice automata
- Learning conjunctions of Horn clauses
- Learning deterministic automata on infinite words
- Learning functions represented as multiplicity automata
- Learning I/O automata
- Learning recursive functions: A survey
- Learning regular omega languages
- Learning regular omega languages
- Learning regular sets from queries and counterexamples
- Learning symbolic automata
- Learning the Language of Error
- Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
- Minimization, Learning, and Conformance Testing of Boolean Programs
- Mining specifications
- Modalities for model checking: Branching time logic strikes back
- On the learnability of infinitary regular sets
- Passive learning of deterministic Büchi automata by combinations of DFAs
- Polynomial identification of \(\omega \)-automata
- PRIMES is in P
- Rational and Recognisable Power Series
- Regular model checking using inference of regular languages
- Representing regular languages of infinite words using mod 2 multiplicity automata
- Teaching a smarter learner.
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Tools and Algorithms for the Construction and Analysis of Systems
- Ultimately periodic words of rational ω-languages
- Why These Automata Types?
This page was built for publication: Constructing concise characteristic samples for acceptors of omega regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034619)
