Hierarchies and reducibilities on regular languages related to modulo counting
From MaRDI portal
Publication:3549290
Recommendations
Cites work
- scientific article; zbMATH DE number 1688391 (Why is no real title available?)
- scientific article; zbMATH DE number 2086254 (Why is no real title available?)
- scientific article; zbMATH DE number 3137366 (Why is no real title available?)
- scientific article; zbMATH DE number 4028925 (Why is no real title available?)
- scientific article; zbMATH DE number 4041255 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 1304310 (Why is no real title available?)
- scientific article; zbMATH DE number 618821 (Why is no real title available?)
- scientific article; zbMATH DE number 2016845 (Why is no real title available?)
- scientific article; zbMATH DE number 2051828 (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 3229502 (Why is no real title available?)
- scientific article; zbMATH DE number 3248792 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- A reducibility for the dot-depth hierarchy
- A uniform approach to define complexity classes
- Actions, wreath products of \(\mathcal C\)-varieties and concatenation product.
- Algebraic decision procedures for local testability
- An application of the Ehrenfeucht-Fraisse game in formal language theory
- Characterizations of some classes of regular events
- Classifying regular events in symbolic logic
- Dot-depth of star-free events
- Fine Hierarchy of Regular Aperiodic ω-Languages
- First-order logic and star-free sets
- Languages polylog-time reducible to dot-depth 1/2
- Machines, Computations, and Universality
- Mathematical Foundations of Computer Science 2004
- New Computational Paradigms
- On Existentially First-Order Definable Languages and Their Relation to NP
- On finite monoids having only trivial subgroups
- On the acceptance power of regular languages
- On ω-regular sets
- Polynomial closure and unambiguous product
- RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS
- Regular languages defined with generalized quantifiers
- Regular languages in \(NC\)
- Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies
- STACS 2005
- The chain method to separate counting classes
- Topology and descriptive set theory
Cited in
(20)- scientific article; zbMATH DE number 1839454 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2004
- scientific article; zbMATH DE number 1936756 (Why is no real title available?)
- Extending Wagner's hierarchy to deterministic visibly pushdown automata
- Logic vs topology on regular \(\omega \)-languages
- Fine hierarchies via Priestley duality
- The Boolean algebra of piecewise testable languages
- Fine hierarchies and m-reducibilities in theoretical computer science
- Efficient algorithms for membership in Boolean hierarchies of regular languages
- scientific article; zbMATH DE number 1396734 (Why is no real title available?)
- Moore reducibility for regular languages
- scientific article; zbMATH DE number 7770056 (Why is no real title available?)
- New Computational Paradigms
- scientific article; zbMATH DE number 1534571 (Why is no real title available?)
- Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies
- A reducibility for the dot-depth hierarchy
- Some uncountable hierarchies of formal languages
- A survey on difference hierarchies of regular languages
- Well-Quasi Orders and Hierarchy Theory
- Boolean algebras of regular languages
This page was built for publication: Hierarchies and reducibilities on regular languages related to modulo counting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549290)
