Identification of birfsa languages.
From MaRDI portal
Publication:2490821
DOI10.1016/j.tcs.2006.01.029zbMath1160.68417MaRDI QIDQ2490821
Aurélien Lemay, Alain Terlutte, Michel Latteux, Yves Roos
Publication date: 18 May 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.029
68Q45: Formal languages and automata
Related Items
Cites Work
- Bideterministic automata and minimal representations of regular languages
- Efficient learning of context-free grammars from positive structural examples
- Learning regular languages using RFSAs.
- On polynomial-time learnability in the limit of strictly deterministic automata
- Identification in the limit of categorial grammars
- Minimal NFA and biRFSA Languages
- Inference of Reversible Languages
- Language identification in the limit
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item