Finite loops recognize exactly the regular open languages

DOI10.1007/3-540-63165-8_169zbMath1401.68213OpenAlexW1522490811MaRDI QIDQ4571944

Martin Beaudry, François Lemieux, Denis Thérien

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_169

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items (5)

Conservative groupoids recognize only regular languages ⋮ Space Complexity of Reachability Testing in Labelled Graphs ⋮ Languages recognized by finite aperiodic groupoids ⋮ Space complexity of reachability testing in labelled graphs ⋮ Language equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The kernel of monoid morphisms
• Une topologie du monoide libre
• Sur mon article Une topologie du monoide libre
• Topologies for the free monoid
• Two-sided wreath product of categories
• Extensions to Barrington's M-program model
• General context-free recognition in less than cubic time
• INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
• Embedding Incomplete Latin Squares
• A topological approach to a conjecture of Rhodes
• Finite monoids and the fine structure of NC ¹
• Polynomial closure of group languages and open sets of the Hall topology
• On finite monoids having only trivial subgroups
• Algebraic automata and context-free sets
• Contributions to the Theory of Loops
• Quasigroups. II
• A topology for free groups and related groups

This page was built for publication: Finite loops recognize exactly the regular open languages