Languages of dot-depth 3/2
From MaRDI portal
Publication:2480745
DOI10.1007/s00224-007-9002-0zbMath1141.68037OpenAlexW2064373707MaRDI QIDQ2480745
Christian Glaßer, Heinz Schmitz
Publication date: 3 April 2008
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-9002-0
Related Items (12)
Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words ⋮ Efficient algorithms for membership in Boolean hierarchies of regular languages ⋮ Concatenation hierarchies: new bottle, old wine ⋮ The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words ⋮ Theme and Variations on the Concatenation Product ⋮ AROUND DOT-DEPTH ONE ⋮ Complexity of universality and related problems for partially ordered NFAs ⋮ Generic results for concatenation hierarchies ⋮ Varieties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semigroups and languages of dot-depth two
- A generalization of the Schützenberger product of finite monoids
- Classification of finite monoids: the language approach
- Classifying regular events in symbolic logic
- Polynomial operations and hierarchies of concatenation
- The dot-depth hierarchy of star-free languages is infinite
- Polynomial closure and unambiguous product
- Finite semigroup varieties of the form V*D
- Dot-depth of star-free events
- An application of the Ehrenfeucht-Fraisse game in formal language theory
- Nondeterministic Space is Closed under Complementation
- Algebraic decision procedures for local testability
- THE WREATH PRODUCT PRINCIPLE FOR ORDERED SEMIGROUPS
- Mathematical Foundations of Computer Science 2004
- On finite monoids having only trivial subgroups
This page was built for publication: Languages of dot-depth 3/2
