INVERSE MONOIDS OF DOT-DEPTH TWO

DOI10.1142/S0218196793000263MaRDI QIDQ4285340zbMATH OpenOpenAlexFDO

Authors David F. Cowan

Publication date 17 July 1995

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218196793000263

zbMATH Keywords

generatorsidempotentsdot-depth hierarchysyntactic monoidsstar-free languageseffective procedurefinite aperiodic monoidsdot-depth of aperiodic monoidsinverse monoids of dot-depth two

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Free semigroups, generators and relations, word problems (20M05) Inverse semigroups (20M18) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• Inverse monoids of dot-depth two
• On dot-depth two
• THE DOT-DEPTH OF A GENERATING CLASS OF APERIODIC MONOIDS IS COMPUTABLE
• Some results on the dot-depth hierarchy
• scientific article; zbMATH DE number 1254093

Cited in

(12)

• A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
• Polynomial closure and unambiguous product
• On dot-depth two
• A conjecture on the concatenation product
• THE DOT-DEPTH OF A GENERATING CLASS OF APERIODIC MONOIDS IS COMPUTABLE
• Some results on the dot-depth hierarchy
• Inverse monoids of dot-depth two
• Logic, semigroups and automata on words
• Polynomial closure and unambiguous product
• \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata
• A counterexample to a conjecture concerning concatenation hierarchies
• 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 Q4285340)