Finite loops recognize exactly the regular open languages

DOI10.1007/3-540-63165-8_169MaRDI QIDQ4571944zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1688356
• Conservative groupoids recognize only regular languages
• Boolean algebras of regular languages
• Polynomial closure of group languages and open sets of the Hall topology
• Loop-free alternating finite automata

Cites work

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

Cited in

(9)

• Languages recognized by finite aperiodic groupoids
• The single loop representations of regular languages
• Language equations
• Space complexity of reachability testing in labelled graphs
• scientific article; zbMATH DE number 1688356 (Why is no real title available?)
• scientific article; zbMATH DE number 1744112 (Why is no real title available?)
• Conservative groupoids recognize only regular languages
• Space Complexity of Reachability Testing in Labelled Graphs
• The n-ary initial literal and literal shuffle

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

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