Grammatical Inference: Algorithms and Applications

DOI10.1007/B101520MaRDI QIDQ5493035zbMATH OpenOpenAlexFDO

Authors Jorge Calera-Rubio, Jose Oncina

Publication date 20 October 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b101520

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32)

Recommendations

• scientific article; zbMATH DE number 2089362
• On linear languages recognized by deterministic biautomata
• A descriptive characterisation of linear languages
• Deterministic biautomata and subclasses of deterministic linear languages
• Linear Context Free Languages
• A descriptive characterisation of even linear languages
• Deciding determinism of regular languages
• Right and left locally testable languages
• A characterisation of deterministic context-free languages by means of right-congruences
• Kleene modules and linear languages

Cited in

(2)

• A deterministic algorithm for identifying direct superclasses in Java
• scientific article; zbMATH DE number 79067 (Why is no real title available?)

This page was built for publication: Grammatical Inference: Algorithms and Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5493035)