Efficient algorithms for membership in Boolean hierarchies of regular languages
From MaRDI portal
(Redirected from Publication:306282)
Recommendations
- Efficient algorithms for membership in Boolean hierarchies of regular languages
- An efficient null-free procedure for deciding regular language membership
- Efficient Enumeration of Regular Languages
- Boolean algebras of regular languages
- Boolean Algebras of Regular Languages
- Compressed membership problems for regular expressions and hierarchical automata
- Efficient algorithms for morphisms over omega-regular languages
- Boolean circuit complexity of regular languages
- scientific article; zbMATH DE number 777280
- Efficient separability of regular languages by subsequences and suffixes
Cites work
- scientific article; zbMATH DE number 1688391 (Why is no real title available?)
- scientific article; zbMATH DE number 988805 (Why is no real title available?)
- scientific article; zbMATH DE number 3137366 (Why is no real title available?)
- scientific article; zbMATH DE number 3827223 (Why is no real title available?)
- scientific article; zbMATH DE number 4087055 (Why is no real title available?)
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 618821 (Why is no real title available?)
- scientific article; zbMATH DE number 2080228 (Why is no real title available?)
- scientific article; zbMATH DE number 1747443 (Why is no real title available?)
- scientific article; zbMATH DE number 1396734 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- A generalization of the Schützenberger product of finite monoids
- Characterizations of some classes of regular events
- Classification of finite monoids: the language approach
- Classifying regular events in symbolic logic
- Complexity of some problems from the theory of automata
- Dot-depth of star-free events
- Efficient algorithms for membership in Boolean hierarchies of regular languages
- Finite semigroup varieties of the form V*D
- Finite-automaton aperiodicity is PSPACE-complete
- First-order logic and star-free sets
- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
- Hierarchies and reducibilities on regular languages related to modulo counting
- Languages of dot-depth 3/2
- Languages polylog-time reducible to dot-depth 1/2
- Logic, semigroups and automata on words
- Mathematical Foundations of Computer Science 2004
- Nondeterministic Space is Closed under Complementation
- On finite monoids having only trivial subgroups
- On the Computational Complexity of Algorithms
- On the expressive power of temporal logic
- Polynomial closure and unambiguous product
- Programs over semigroups of dot-depth one
- Regular languages in \(NC\)
- Relationships between nondeterministic and deterministic tape complexities
- Semigroups and languages of dot-depth two
- THE WREATH PRODUCT PRINCIPLE FOR ORDERED SEMIGROUPS
- The Boolean Hierarchy I: Structural Properties
- The difference and truth-table hierarchies for NP
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(6)- On the main scientific achievements of Victor Selivanov
- Difference hierarchies and duality with an application to formal languages
- Efficient algorithms for membership in Boolean hierarchies of regular languages
- Deciding classes of regular languages: the covering approach
- A survey on difference hierarchies of regular languages
- Well-Quasi Orders and Hierarchy Theory
This page was built for publication: Efficient algorithms for membership in Boolean hierarchies of regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306282)
