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

DOI10.1016/S0304-3975(96)00120-XzbMath0877.68076OpenAlexW1520554460MaRDI QIDQ1349899

Jean-Eric Pin

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00120-x

zbMATH Keywords

finite automataalgebraic characterizationgroup languagespolynomial closureHall topology

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

POLYNOMIAL CLOSURE AND TOPOLOGY ⋮ SEMIDIRECT PRODUCTS OF ORDERED SEMIGROUPS ⋮ Polynomial closure and unambiguous product ⋮ On the group of a rational maximal bifix code ⋮ Regular languages and partial commutations ⋮ Unnamed Item ⋮ ON PROFINITE UNIFORM STRUCTURES DEFINED BY VARIETIES OF FINITE MONOIDS ⋮ Theme and Variations on the Concatenation Product ⋮ EQUATIONAL DESCRIPTIONS OF LANGUAGES ⋮ Imre Simon: an exceptional graduate student ⋮ Language equations ⋮ Constructing divisions into power groups ⋮ Algebraic tools for the concatenation product.

Cites Work

• Une topologie du monoide libre
• Sur mon article Une topologie du monoide libre
• Classifying regular events in symbolic logic
• Topologies for the free monoid
• Sur le produit de concatenation non ambigu
• Logic, semigroups and automata on words
• 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 PRO-p TOPOLOGY OF A FREE GROUP AND ALGORITHMIC PROBLEMS IN SEMIGROUPS
• The product of rational languages
• A topology for free groups and related groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item