scientific article

zbMath0643.68073MaRDI QIDQ3785956

Wolfgang Thomas

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Ehrenfeucht-Fraïssé gamedot-depth hierarchystar-free regular expressions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (10)

On the Ehrenfeucht-Fraïssé game in theoretical computer science ⋮ Star-free picture expressions are strictly weaker than first-order logic ⋮ The product of rational languages ⋮ Subsequence versus substring constraints in sequence pattern languages ⋮ Classifying regular languages by a split game ⋮ Generic results for concatenation hierarchies ⋮ A reducibility for the dot-depth hierarchy ⋮ Equations and monoid varieties of dot-depth one and two ⋮ A conjecture on the concatenation product ⋮ On a complete set of generators for dot-depth two

This page was built for publication: