Inferring regular trace languages from positive and negative samples

DOI10.1007/978-3-642-15488-1_3MaRDI QIDQ3588361zbMATH OpenOpenAlexFDO

Authors Antonio Cano Gómez

Publication date 10 September 2010

Published in Grammatical Inference: Theoretical Results and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15488-1_3

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Recommendations

• Learning Commutative Regular Languages
• Asynchronous cellular automata for infinite traces
• Learning Regular Languages Using Nondeterministic Finite Automata
• scientific article; zbMATH DE number 1015097
• On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages

Cited in

(4)

• Commutative regular languages with product-form minimal automata
• Inferring pure context-free languages from positive data
• Learning Commutative Regular Languages
• scientific article; zbMATH DE number 2019592 (Why is no real title available?)

This page was built for publication: Inferring regular trace languages from positive and negative samples

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