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

DOI10.1007/3-540-58201-0_87MaRDI QIDQ4632445zbMATH OpenOpenAlexFDO

Authors Jean-Éric 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 groupfinite unionfree monoidgroup language

Mathematics Subject Classification ID

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

Cites work

• A Conjecture on the Hall Topology for the Free Group
• A topological approach to a conjecture of Rhodes
• A topology for free groups and related groups
• ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
• Classifying regular events in symbolic logic
• scientific article; zbMATH DE number 3920797 (Why is no real title available?)
• scientific article; zbMATH DE number 3920804 (Why is no real title available?)
• scientific article; zbMATH DE number 3972214 (Why is no real title available?)
• scientific article; zbMATH DE number 4020506 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• scientific article; zbMATH DE number 459360 (Why is no real title available?)
• scientific article; zbMATH DE number 864845 (Why is no real title available?)
• INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
• On The Profinite Topology on a Free Group
• Sur mon article Une topologie du monoide libre
• The product of rational languages
• Topologies for the free monoid
• Une topologie du monoide libre

Cited in

(5)

• Topology on words
• Some complexity results for polynomial rational expressions.
• Finite loops recognize exactly the regular open languages
• A survey on difference hierarchies of regular languages
• On the complexity of computing the profinite closure of a rational language

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

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