Relating automata-theoretic hierarchies to complexity-theoretic hierarchies

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2138, Issue , 2001, Pages 323-334

  Selivanov, V L ^a  

^a A P ERSHOV INSTITUTE OF INFORMATICS SYSTEMS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

LEAF LANGUAGES; POLYNOMIAL HIERARCHIES; POLYNOMIAL-TIME HIERARCHY;

POLYNOMIAL APPROXIMATION;

EID: 84974716088     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44669-9_31     Document Type: Conference Paper

References (22)

1. J. L. Balcázar, J. Díaz and J. Gabarró. Structural Complexity I, volume 11 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1988.
2. J. L. Balcázar, J. Díaz and J. Gabarró. Structural Complexity II, volume 11 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1990.
3. D. P. Bovet, P. Crescenzi and R. Silvestri. A uniform approach to define complexity classes. Theoret. Comp. Sci, 104 (1992), 263-283.
4. J. A. Brzozowski and R Knast. The dot-depth hierarchy of star–free languages is infinite. J. Comp. Systems Sci., 16 (1978), 37-55.
5. H.-J. Burtschick and H. Vollmer. Lindström Quatifiers and Leaf Language Definability. Int. J. of Foundations of Computer Science, 9 (1998), 277-294.
6. U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer and K. W. Wagner. On the power of polynomial time bit-reductions, Proc. 8th Structure in Complexity Theory, 1993, 200-207.
7. K. Kuratowski and A. Mostowski. Set Theory. North Holland, 1967.
8. J. Köbler, U. Shöning and K.W. Wagner: The difference and truth-table hierarchies for NP. Dep. of Informatics, Koblenz. Preprint 7 (1986).
9. R. McNaughton and S. Papert. Counter–free automata. MIT Press, Cambridge, Massachusets, 1971.
10. D. Perrin and J.-E. Pin. First order logic and star–free sets. J. Comp. and Syst. Sci., 32 (1986), 393-406.
11. J.-E. Pin and P. Weil. Polynomial closure and unambiguous product. Theory of Computing Systems, 30 (1997), 383-422.
12. V. L. Selivanov. Two refinements of the polynomial hierarchy. In: Proc. of Symposium on Theor. Aspects of Computer Science STACS–94, Lecture Notes in Computer Science, v. 775. Springer: Berlin 1994, p. 439-448.
13. V. L. Selivanov. Refiningthe polynomial hierarchy, Preprint No 9, the University of Heidelberg, Chair of Mathematical Logic, 1994, 20 p.
14. V. L. Selivanov. Fine hierarchies and Boolean terms. Journal of Symbolic Logic, 60 (1995), p. 289-317.
15. V. L. Selivanov. Refiningthe polynomial hierarchy. Algebra and Logic, 38 (1999), 456-475 (Russian, there is an English translation).
16. V. L. Selivanov. A logical approach to decidability of hierarchies of regular star-free languages. In: Proc. of 18-th Int. Symposium on Theor. Aspects of Computer Science STACS-2001 in Dresden, Germany, Lecture Notes in Computer Science, v. 2010. Berlin: Springer, 2001, 539–550.
17. V. L. Selivanov and A. G. Shukin. On hierarchies of regular star-free languages (in Russian). Preprint 69 of A.P. Ershov Institute of Informatics Systems, 2000, 28 p.
18. A. G. Shukin. Difference hierarchies of regular languages. Comp. Systems, Novosibirsk, 161 (1998), 141-155 (in Russian).
19. H. Schmitz and K. W Wagner. The Boolean hierarchy over level 1/2 of the Sraubing–Therien hierarchy, Technical Report 201, Inst. für Informatik, Univ. Würzburg(a vailable at http://www.informatik.uni-wuerzburg.de).
20. W. Thomas. Classifying regular events in symbolic logic. J. Comp. and Syst. Sci.,25 (1982), 360-376.
21. N. K. Vereshchagin. Relativizable and non-relativizable theorems in the polynomial theory of algorithms. Izvestiya Rossiiskoi Akademii Nauk, 57 (1993), 51-90 (in Russian).
22. G. Wechsungand K. Wagner. On the Boolean closure of NP. In: Proceedings of the 1985 Int. Conf. on Fundamentals of Computation theory, v.199 of Lecture Notes in Computer Science, p.485-493. Springer–Verlag, 1985.