Polynomial closure and unambiguous product

DOI10.1007/3-540-60084-1_87zbMath1412.68145OpenAlexW1796835294MaRDI QIDQ4645191

Jean-Eric Pin, Pascal Weil

Publication date: 10 January 2019

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

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.5925

zbMATH Keywords

inverse monoidsequential calculusrelational morphismfinite unionalgebraic counterpart

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items

On the Non-deterministic Communication Complexity of Regular Languages, Separating Without Any Ambiguity., Generic results for concatenation hierarchies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factorization forests of finite height
• Characterizations of some classes of regular events
• First-order logic and star-free sets
• Locally trivial categories and unambiguous concatenation
• Semigroups and languages of dot-depth two
• Partially ordered finite monoids and a theorem of I. Simon
• Inverse monoids of dot-depth two
• The Birkhoff theorem for finite algebras
• Classifying regular events in symbolic logic
• Polynomial operations and hierarchies of concatenation
• On a conjecture concerning dot-depth two languages
• Some results on the dot-depth hierarchy
• Varieties of ordered algebras
• Sur le produit de concatenation non ambigu
• Aperiodic homomorphisms and the concatenation product of recognizable sets
• On a complete set of generators for dot-depth two
• A Reiterman theorem for pseudovarieties of finite first-order structures
• Profinite semigroups, Mal'cev products, and identities
• INVERSE MONOIDS OF DOT-DEPTH TWO
• The product of rational languages
• On finite monoids having only trivial subgroups
• On dot-depth two