Inverse monoids of dot-depth two

DOI10.1016/0304-3975(89)90151-5MaRDI QIDQ1124363zbMATH OpenOpenAlexFDO

Authors Pascal Weil

Publication date 1989

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

Full work available at URL https://doi.org/10.1016/0304-3975(89)90151-5

zbMATH Keywords

dot-depth hierarchyinverse monoidsstar-free regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• INVERSE MONOIDS OF DOT-DEPTH TWO
• On a complete set of generators for dot-depth two
• On a conjecture concerning dot-depth two languages
• Some results on the dot-depth hierarchy
• On dot-depth two

Cites work

• scientific article; zbMATH DE number 3827223 (Why is no real title available?)
• scientific article; zbMATH DE number 3961008 (Why is no real title available?)
• scientific article; zbMATH DE number 4034007 (Why is no real title available?)
• scientific article; zbMATH DE number 4037246 (Why is no real title available?)
• scientific article; zbMATH DE number 3654376 (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 3894493 (Why is no real title available?)
• scientific article; zbMATH DE number 3368555 (Why is no real title available?)
• A generalization of the Schützenberger product of finite monoids
• Categories as algebra: An essential ingredient in the theory of monoids
• Catégories et langages de dot-depth un
• Characterizations of locally testable events
• Classifying regular events in symbolic logic
• Dot-depth of star-free events
• Finite semigroup varieties of the form V*D
• First-order logic and star-free sets
• On finite monoids having only trivial subgroups
• Parity, circuits, and the polynomial-time hierarchy
• The dot-depth hierarchy of star-free languages is infinite
• Varieties of finite categories
• Weak Second‐Order Arithmetic and Finite Automata

Cited in

(16)

• Polynomial closure and unambiguous product
• Two-dimensional monadicity
• Semigroups and languages of dot-depth two
• On dot-depth two
• Some complexity results for polynomial rational expressions.
• A conjecture on the concatenation product
• INVERSE MONOIDS OF DOT-DEPTH TWO
• Inclusion relations between some congruences related to the dot-depth hierarchy
• Equations and monoid varieties of dot-depth one and two
• Some results on the dot-depth hierarchy
• AUTOMATE, a computing package for automata and finite semigroups
• The product of rational languages
• Logic, semigroups and automata on words
• Polynomial closure and unambiguous product
• Polynomial operations and hierarchies of concatenation
• On a conjecture concerning dot-depth two languages

This page was built for publication: Inverse monoids of dot-depth two

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