Some logical characterizations of the dot-depth hierarchy and applications

DOI10.1006/jcss.1995.1071zbMath0831.68066OpenAlexW2117812716MaRDI QIDQ1900936

Francine Blanchet-Sadri

Publication date: 25 October 1995

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: http://libres.uncg.edu/ir/uncg/f/F_Blanchet-Sadri_Some_1995.pdf

zbMATH Keywords

dot-depth hierarchy

Mathematics Subject Classification ID

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

Related Items (8)

Polynomial closure and unambiguous product ⋮ Inclusion relations between some congruences related to the dot-depth hierarchy ⋮ Equations on the semidirect product of a finite semilattice by a $\mathcal {J}$-trivial monoid of height $k$ ⋮ Games, equations and dot-depth two monoids ⋮ IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS ⋮ On semidirect and two-sided semidirect products of finite $\mathcal {J}$trivial monoids ⋮ Equations and monoid varieties of dot-depth one and two ⋮ On a complete set of generators for dot-depth two

This page was built for publication: Some logical characterizations of the dot-depth hierarchy and applications