Learning two-tape automata from queries and counterexamples
From MaRDI portal
Publication:4879209
DOI10.1007/BF01201279zbMath0849.68083WikidataQ124969694 ScholiaQ124969694MaRDI QIDQ4879209
Publication date: 27 May 1996
Published in: Mathematical Systems Theory (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
Some decisional problems on rational relations, Even linear simple matrix languages: formal language properties and grammatical inference., Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning regular sets from queries and counterexamples
- Grammatical inference for even linear languages based on control sets
- When won't membership queries help?
- Sets recognized by n-tape automata
- Regular prefix relations
- On Relations Defined by Generalized Finite Automata
- The theory of sequential relations
- A machine realization of the linear context-free languages
- Generalizations of regular events