INVERSE MONOIDS OF DOT-DEPTH TWO

DOI10.1142/S0218196793000263zbMath0816.20064OpenAlexW2048435760MaRDI QIDQ4285340

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

idempotentsgeneratorsdot-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) Free semigroups, generators and relations, word problems (20M05) Automata and formal grammars in connection with logical questions (03D05) Semigroups in automata theory, linguistics, etc. (20M35) Inverse semigroups (20M18)

Related Items (7)

Polynomial closure and unambiguous product ⋮ Polynomial closure and unambiguous product ⋮ A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS ⋮ A counterexample to a conjecture concerning concatenation hierarchies ⋮ Logic, semigroups and automata on words ⋮ \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata ⋮ A conjecture on the concatenation product

This page was built for publication: INVERSE MONOIDS OF DOT-DEPTH TWO