Learning Commutative Regular Languages
From MaRDI portal
Publication:3528408
DOI10.1007/978-3-540-88009-7_6zbMath1177.68107OpenAlexW1606449364MaRDI QIDQ3528408
Gloria Alvarez, Antonio Cano Gómez
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
Computational learning theory (68Q32) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)
Related Items (6)
Constrained synchronization and commutativity ⋮ 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 ⋮ Characterization and complexity results on jumping finite automata
This page was built for publication: Learning Commutative Regular Languages