Polynomial closure and unambiguous product
From MaRDI portal
Publication:4645191
DOI10.1007/3-540-60084-1_87zbMATH Open1412.68145OpenAlexW1796835294MaRDI QIDQ4645191FDOQ4645191
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
Cites Work
- Varieties of ordered algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
- On finite monoids having only trivial subgroups
- Classifying regular events in symbolic logic
- Title not available (Why is that?)
- Characterizations of some classes of regular events
- First-order logic and star-free sets
- Semigroups and languages of dot-depth two
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Birkhoff theorem for finite algebras
- Locally trivial categories and unambiguous concatenation
- Some results on the dot-depth hierarchy
- Sur le produit de concatenation non ambigu
- Partially ordered finite monoids and a theorem of I. Simon
- Factorization forests of finite height
- On a conjecture concerning dot-depth two languages
- On dot-depth two
- Profinite semigroups, Mal'cev products, and identities
- Polynomial operations and hierarchies of concatenation
- A Reiterman theorem for pseudovarieties of finite first-order structures
- Aperiodic homomorphisms and the concatenation product of recognizable sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- INVERSE MONOIDS OF DOT-DEPTH TWO
- Inverse monoids of dot-depth two
- Title not available (Why is that?)
- On a complete set of generators for dot-depth two
- The product of rational languages
Cited In (3)
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)
