Passive learning of regular data languages in polynomial time and data
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 7204453 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 7649933 (Why is no real title available?)
- An automaton over data words that captures EMSO logic
- Automata theory in nominal sets
- Bisimilarity in Fresh-Register Automata
- Characteristic sets for polynomial grammatical inference
- Church synthesis on register automata over linearly ordered data domains
- Constructing deterministic \(\omega\)-automata from examples by an extension of the RPNI algorithm
- Data communicating processes with unreliable channels
- Finite-memory automata
- Fresh-register automata
- History-register automata
- Inferring Symbolic Automata
- Inferring canonical register automata
- LTL reactive synthesis with a few hints
- Language identification in the limit
- Learning Meets Verification
- Learning nominal automata
- Learning register automata: from languages to program structures
- Model checking languages of data words
- On the Inference of Finite State Automata from Positive and Negative Data
- On the length of subgroup chains in the symmetric group
- Passive learning of deterministic Büchi automata by combinations of DFAs
- Synthesis of data word transducers
- Verification of dynamic register automata
- Walking on data words
This page was built for publication: Passive learning of regular data languages in polynomial time and data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859947)
