First-order logic and star-free sets
Journal of Computer and System Sciences
The Boolean hierarchy: hardware over NP
Proc. of the conference on Structure in complexity theory
Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Structural complexity 1
The polynomial time hierarchy collapses if the Boolean hierarchy collapses
SIAM Journal on Computing
Structural complexity 2
Handbook of theoretical computer science (vol. B)
Finite-automaton aperiodicity is PSPACE-complete
Theoretical Computer Science
Countable structures, Ehrenfeucht strategies, and Wadge reductions
Journal of Symbolic Logic
A uniform approach to define complexity classes
Theoretical Computer Science
Theoretical Computer Science
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Fine hierarchies and Boolean terms
Journal of Symbolic Logic
On the acceptance power of regular languages
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
Handbook of logic in computer science (vol. 3)
Fine hierarchy and definability in the Lindenbaum algebra
Logic: from foundations to applications
Topological complexity with continuous operations
Journal of Complexity - Special issue for the Foundations of Computational Mathematics conference, Rio de Janeiro, Brazil, Jan. 1997
Handbook of formal languages, vol. 3
Fine hierarchy of regular &ohgr;-languages
Theoretical Computer Science
A note on parallel queries and the symmetric-difference hierarchy
Information Processing Letters
A Downward Collapse within the Polynomial Hierarchy
SIAM Journal on Computing
SIAM Journal on Computing
Computable analysis: an introduction
Computable analysis: an introduction
The Boolean structure of dot-depth one
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Varieties Of Formal Languages
Two Refinements of the Polynomial Hierarcht
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Fine Hierarchy of Regular omega-Languages
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
FCT '85 Fundamentals of Computation Theory
Equivalence relations, invariants, and normal forms
Proceedings of the Symposium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity
Fundamental study: a hierarchy of deterministic context-free ω-languages
Theoretical Computer Science
Borel hierarchy and omega context free languages
Theoretical Computer Science
On the power of number-theoretic operations with respect to counting
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A reducibility for the dot-depth hierarchy
Theoretical Computer Science - Mathematical foundations of computer science 2004
Borel ranks and Wadge degrees of context free $\omega$-languages
Mathematical Structures in Computer Science
Languages polylog-time reducible to dot-depth 1/2
Journal of Computer and System Sciences
Towards a descriptive set theory for domain-like structures
Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models
European Journal of Combinatorics
Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests
Journal of Logic and Computation
On the Wadge Reducibility of k-Partitions
Electronic Notes in Theoretical Computer Science (ENTCS)
Complexity of Topological Properties of Regular ω-Languages
Fundamenta Informaticae
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Undecidability in Some Structures Related to Computation Theory
Journal of Logic and Computation
Fine hierarchy of regular aperiodic ω-languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
The wadge hierarchy of deterministic tree languages
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Undecidability in the homomorphic quasiorder of finite labeled forests
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
On the topological complexity of weakly recognizable tree languages
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Logical refinements of Church's problem
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
On the topological complexity of ω-languages of non-deterministic Petri nets
Information Processing Letters
| Hi-index | 5.23 |
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and related techniques play a crucial role in understanding complexity of finite and infinite computations. We try not only to present the corresponding notions and facts from the particular fields but also to identify the unifying notions, techniques and ideas.