scientific article
From MaRDI portal
Publication:3774976
zbMath0635.68078MaRDI QIDQ3774976
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (21)
Some complexity results for polynomial rational expressions. ⋮ Polynomial closure and unambiguous product ⋮ Polynomial closure and unambiguous product ⋮ Concatenation hierarchies: new bottle, old wine ⋮ A Note on Decidable Separability by Piecewise Testable Languages ⋮ How many times do you need to go back to the future in unary temporal logic? ⋮ On the state complexity of closures and interiors of regular languages with subwords and superwords ⋮ The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies ⋮ Separating Without Any Ambiguity. ⋮ Theme and Variations on the Concatenation Product ⋮ Languages of dot-depth 3/2 ⋮ A note on partially ordered tree automata ⋮ The globals of pseudovarieties of ordered semigroups containingB2and an application to a problem proposed by Pin ⋮ Unnamed Item ⋮ Quantifier Alternation for Infinite Words ⋮ Separating regular languages with two quantifier alternations ⋮ Generic results for concatenation hierarchies ⋮ Unnamed Item ⋮ Characterizing level one in group-based concatenation hierarchies ⋮ Algebraic tools for the concatenation product. ⋮ A conjecture on the concatenation product
This page was built for publication:
