scientific article; zbMATH DE number 3894493
From MaRDI portal
Publication:5186755
Recommendations
- On decidability of intermediate levels of concatenation hierarchies
- The Complexity of Separation for Levels in Concatenation Hierarchies
- Decidable and undecidable fragments of first-order concatenation theory
- Concatenable structures for decomposable problems
- A counterexample to a conjecture concerning concatenation hierarchies
- Concatenation of regular languages and descriptional complexity
- Concatenation of Regular Languages and Descriptional Complexity
- Weak essentially undecidable theories of concatenation
- The complexity of concatenation on deterministic and alternating finite automata
- The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages
Cited in
(13)- On interpretability in the theory of concatenation
- Characterizations of some classes of regular events
- A property of the Schützenberger product
- Inverse monoids of dot-depth two
- Closure of varieties of languages under products with counter
- Generic results for concatenation hierarchies
- Concatenation hierarchies: new bottle, old wine
- Theme and variations on the concatenation product
- scientific article; zbMATH DE number 1223722 (Why is no real title available?)
- Algebraic and topological theory of languages
- scientific article; zbMATH DE number 3892608 (Why is no real title available?)
- New decidable upper bound of the second level in the Straubing-Thérien concatenation hierarchy of star-free languages
- A counterexample to a conjecture concerning concatenation hierarchies
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 Q5186755)
