Learning Commutative Regular Languages

DOI10.1007/978-3-540-88009-7_6MaRDI QIDQ3528408zbMATH OpenOpenAlexFDO

Authors Antonio Cano Gómez, Gloria Alvarez

Publication date 16 October 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-88009-7_6

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Learning Regular Languages Using Nondeterministic Finite Automata
• Grammatical Inference: Algorithms and Applications
• Algorithms for learning regular expressions from positive data
• Inferring regular trace languages from positive and negative samples
• Inferring uniquely terminating regular languages from positive data

Cited in

(14)

• Learning regular languages from counterexamples
• Learning commutativity specifications
• Computational complexity of synchronization under regular commutative constraints
• Commutative regular languages with product-form minimal automata
• State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages
• The commutative closure of shuffle languages over group languages is regular
• Constrained synchronization and commutativity
• Characterization and complexity results on jumping finite automata
• Inferring regular trace languages from positive and negative samples
• Regular languages and partial commutations
• INFERENCE OF REVERSIBLE LANGUAGES
• scientific article; zbMATH DE number 2040913 (Why is no real title available?)
• State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
• Subset mapping problems in solvable automata

This page was built for publication: Learning Commutative Regular Languages

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