Inference of \(\omega\)-languages from prefixes.

DOI10.1016/j.tcs.2003.11.009zbMath1069.68071OpenAlexW2010088996MaRDI QIDQ1426153

Colin de la Higuera, Jean-Christophe Janodet

Publication date: 14 March 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.11.009

zbMATH Keywords

Grammatical inferenceIdentification in the limitInfinite string languagesPolynomial identification from given data

Mathematics Subject Classification ID

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

Related Items (4)

Learning regular omega languages ⋮ Inferring regular languages and \(\omega\)-languages ⋮ Rational digit systems over finite fields and Christol's theorem ⋮ Improving active Mealy machine learning for protocol conformance testing

Cites Work

• Defining liveness
• Automata-theoretic techniques for modal logics of programs
• Characteristic sets for polynomial grammatical inference
• On the learnability of infinitary regular sets
• Proving the Correctness of Multiprocess Programs
• Complexity of automaton identification from given data
• On the complexity of minimum inference of regular sets
• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Inference of \(\omega\)-languages from prefixes.