Polynomial closure and unambiguous product

DOI10.1007/3-540-60084-1_87MaRDI QIDQ4645191zbMATH OpenOpenAlexFDO

Authors Jean-Éric 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)

Cites work

• scientific article; zbMATH DE number 3827223 (Why is no real title available?)
• scientific article; zbMATH DE number 3972214 (Why is no real title available?)
• scientific article; zbMATH DE number 4034007 (Why is no real title available?)
• scientific article; zbMATH DE number 4035179 (Why is no real title available?)
• scientific article; zbMATH DE number 4037246 (Why is no real title available?)
• scientific article; zbMATH DE number 3702106 (Why is no real title available?)
• scientific article; zbMATH DE number 3495598 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• scientific article; zbMATH DE number 3368555 (Why is no real title available?)
• A Reiterman theorem for pseudovarieties of finite first-order structures
• Aperiodic homomorphisms and the concatenation product of recognizable sets
• Characterizations of some classes of regular events
• Classifying regular events in symbolic logic
• Factorization forests of finite height
• First-order logic and star-free sets
• INVERSE MONOIDS OF DOT-DEPTH TWO
• Inverse monoids of dot-depth two
• Locally trivial categories and unambiguous concatenation
• On a complete set of generators for dot-depth two
• On a conjecture concerning dot-depth two languages
• On dot-depth two
• On finite monoids having only trivial subgroups
• Partially ordered finite monoids and a theorem of I. Simon
• Polynomial operations and hierarchies of concatenation
• Profinite semigroups, Mal'cev products, and identities
• Semigroups and languages of dot-depth two
• Some results on the dot-depth hierarchy
• Sur le produit de concatenation non ambigu
• The Birkhoff theorem for finite algebras
• The product of rational languages
• Varieties of ordered algebras

Cited in

(3)

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

This page was built for publication: Polynomial closure and unambiguous product

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