scientific article; zbMATH DE number 2080228

zbMATH Open1044.68091MaRDI QIDQ4472471FDOQ4472471

Authors: Christian Glaßer, H. Schmitz 

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1974/19740503.htm

Title of this publication is not available (Why is that?)

Recommendations

• The dot-depth hierarchy, 45 years later
• On dot-depth two
• Around dot-depth one
• Around dot-depth one
• THE DOT-DEPTH OF A GENERATING CLASS OF APERIODIC MONOIDS IS COMPUTABLE

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (12)

• The dot-depth hierarchy, 45 years later
• New decidable upper bound of the second level in the Straubing-Thérien concatenation hierarchy of star-free languages
• Separation for dot-depth two
• Title not available (Why is that?)
• Efficient algorithms for membership in Boolean hierarchies of regular languages
• Efficient algorithms for membership in Boolean hierarchies of regular languages
• Algebraic tools for the concatenation product.
• Title not available (Why is that?)
• Title not available (Why is that?)
• A conjecture on the concatenation product
• Languages of dot-depth 3/2
• Some logical characterizations of the dot-depth hierarchy and applications

This page was built for publication:

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