Polynomial closure of group languages and open sets of the Hall topology

DOI10.1007/3-540-58201-0_87zbMath1422.68159OpenAlexW4252325327MaRDI QIDQ4632445

Jean-Eric Pin

Publication date: 29 April 2019

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

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_87

zbMATH Keywords

finite automatonfinite groupfree monoidfinite uniongroup language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Free nonabelian groups (20E05)

Related Items (5)

Some complexity results for polynomial rational expressions. ⋮ A Survey on Difference Hierarchies of Regular Languages ⋮ Finite loops recognize exactly the regular open languages ⋮ On the complexity of computing the profinite closure of a rational language ⋮ Topology on words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Une topologie du monoide libre
• Sur mon article Une topologie du monoide libre
• Classifying regular events in symbolic logic
• Topologies for the free monoid
• INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
• A topological approach to a conjecture of Rhodes
• A Conjecture on the Hall Topology for the Free Group
• ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
• On The Profinite Topology on a Free Group
• The product of rational languages
• A topology for free groups and related groups

This page was built for publication: Polynomial closure of group languages and open sets of the Hall topology