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

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

Jean-Eric Pin

Publication date: 27 February 1997

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

zbMATH Keywords

finite automata; algebraic characterization; group languages; polynomial closure; Hall topology

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

SEMIDIRECT PRODUCTS OF ORDERED SEMIGROUPS, Imre Simon: an exceptional graduate student, POLYNOMIAL CLOSURE AND TOPOLOGY, EQUATIONAL DESCRIPTIONS OF LANGUAGES, Regular languages and partial commutations, Polynomial closure and unambiguous product, Algebraic tools for the concatenation product., Constructing divisions into power groups, ON PROFINITE UNIFORM STRUCTURES DEFINED BY VARIETIES OF FINITE MONOIDS, Theme and Variations on the Concatenation Product

Cites Work

• Unnamed Item
• 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
• 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