Leaf language classes a survey

Lecture Notes in Computer Science

Volumn 3354, Issue , 2005, Pages 60-81

  Wagner, Klaus W ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; SURVEYS;

COMPLEXITY CLASSES; LEAF LANGUAGE CLASSES;

COMPUTER PROGRAMMING LANGUAGES;

EID: 24144495501     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31834-7_5     Document Type: Conference Paper

References (55)

1. [Aa04] S. Aaxonson. The complexity zoo. http://www.complexityzoo.com/
2. [BCS91] D.P. Bovet, P. Crescenzi, R. Silvestri. Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri. Complexity classes and sparse oracles. Proc. 6th IEEE Structure in Complexity Theory Conference, 1991, 102-108.
3. Journal of Computer and System Sciences 50, 1995, 382-390.
4. [BCS92] D.P. Bovet, P. Crescenzi, R. Silvestri. A uniform approach to define complexity classes. Theoret. Comp. Sci, 104 (1992), 263-283.
5. [BDG88] 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.
6. [BDG90] 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.
7. [Bo94a] B. Borchert. On the Acceptance Power of Regular Languages. Proc. 11th Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science 775, Springer Verlag, 1994, pp. 533-542.
8. Final version: Theoretical Computer Science 148, 1995, 207-225.
9. [Bo94b] B. Borchert. Predicate Classes, Promise Classes, and the Acceptance Power of Regular Languages. Ph.D. thesis, Universität Heidelberg, 1994.
10. [Bo04] B. Borchert. Personal communication.
11. [BKS99] B. Borchert, D. Kuske and F. Stephan. On existentially first-order definable languages and their relation to NP. Theor. Informatics Appl., 33 (1999), 259-269.
12. [BLSTT04] B. Borchert, K-J. Lange, F. Stephan, P. Tesson, D. Thérien. The dot-depth and the polynomial hierarchy correspond on the delta levels. Technical Report 2004-03, Wilhelm-Schickard-Institut, Universität Tübingen. To appear in the proceedings of DLT 2004.
13. [BL96] B. Borchert, A. Lozano. Succinct Circuit Representations and Leaf Language Classes are Basically the Same Concept. Information Processing Letters 58, 1996, 211-215.
14. [BS97] B. Borchert, R. Silvestri. A Characterization of the Leaf Language Classes. Information Processing Letters 63, 1997, 153-158.
15. Preliminary version: B. Borchert. Predicate classes and promise classes, Proc. 9th Structure in Complexity Theory Conference, 1994, 235-241.
16. [BS01] B. Borchert, R. Silvestri. Dot Operators. Theoretical Computer Science 262(1), 2001, 501-523.
17. [BV98] H.-J. Burtschick and H. Vollmer. Lindström Quatifiers and Leaf Language Definability. Int. J. of Foundations of Computer Science, 9 (1998), 277-294.
18. [BSS99] B. Borchert, H. Schmitz, F. Stephan. Unpublished manuscript, 1999.
19. [CHVW98] K. Cronauer, U. Hertrampf, H. Vollmer and K.W. Wagner. The chain method to separate counting classes. Theory Comput. Systems, 31 (1998), 93-108.
20. [CMTV98] H. Caussinus, P. McKenzie, D. Thérien, H. Vollmer. Nondeterministic NC1 Computation. Journal of Computer and System Sciences 57, 1998, 200-212.
21. [Ga98] M. Galota, Blattsprachen und endliche Automaten. Technical Report No. 205, University of Würzburg, Department of Computer Science, 1.
22. [GKV03] M. Galota, S. Kosub, H. Vollmer. Generic Separations and Leaf Languages, to appear in Mathematical Logic Quarterly, 2003.
23. [G104] Ch. Glaßer. Counting with Counterfree Automata Electronic Colloquium on Computational Complexity, Report TR04-011, 2004. Technical Report No. 315, University of Würzburg, 2004.
24. [GP86] L.M. Goldschlager, I. Parberry. On the Construction of Parallel Computers from Various Bases of Boolean Functions. Theoretical Computer Science 43, 1986, 43-58.
25. [GV01] M. Galota, H. Vollmer. A generalization of the Büchi-Elgot-Trakhtenbrot theorem. Proc. 15th Computer Science Logic 2001, Lecture Notes in Computer Science Vol. 2142, 2001, 355-368.
26. [GV03] M. Galota, H. Vollmer. Functions computable in polynomial space. Manuscript 2003.
27. [He92a] U. Hertrarnpf. Locally Definable Acceptance Types for Polynomial Time Machines. Proc. 9th Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science 577, Springer Verlag, 1992, 199-207.
28. [He92b] U. Hertrampf. Locally Definable Acceptance Types - the Three Valued Case. 1st Latin American Symposium in Theoretical Informatics, Lecture Notes in Computer Science 583, Springer Verlag, 1992, 262-271.
29. [He94a] U. Hertrampf. Complexity Classes with Finite Acceptance Types. Proc. 11th Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science 775, Springer Verlag, 1994, 543-553.
30. [He94b] U. Hertrampf. Complexity Classes Defined via k-Valued Functions. Proc. 9th Structure in Complexity Theory Conference, 1994, 224-234.
31. [HLSVW93] 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.
32. [HVW96] U. Hertrampf, H. Vollmer and K.W. Wagner. On balanced vs. unbalanced computation trees, Math. Systems Theory 29 (1996), 411-421.
33. [JMT94] B. Jenner, P. McKenzie and D. Thérien. Logspace and logtime leaf languages, 9th Annual Conference on Structure in Complexity Theory 1994, 242-254.
34. Information and Computation, 129 (1996), 21-33.
35. [Ko00] S. Kosub. On NP-partitions over posets with an application to reducing the set of solutions of NP problems. Proc. 25th Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science Vol. 1893, 2000, 467-476.
36. [KSV00] S. Kosub, H. Schmitz, H. Vollmer. Uniformly defining complexity classes of functions. International Journal of Foundations of Computer Science 11(4), 2000, 525-551.
37. [NR98] R. Niedermeier, P. Rossmanith. Unambiguous computations and locally definable acceptance types. Theoretical Computer Science 194, 1998, 137-161.
38. [Pa94] Ch.H. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
39. [PV01] T. Peichl, H. Vollmer. Finite automata with generalized acceptance criteria. Discrete Mathematics and Theoretical Computer Science 4, 2001, 179-192.
40. [Pi96] J.-E. Pin. Syntactic semigroups. In: G. Rozenberg and A. Salomaa (editors), Handbook of formal languages, Volume 1. 679-746. Springer, 1996.
41. [Sch00] H. Schmitz. The forbidden pattern approach to concatenation hierachies. Ph.D. Thesis, University of Würzburg 2000.
42. [SW98] H. Schmitz, K. Wagner. The Boolean Hierarchy over Level 1/2 of the Straubing-Therien Hierarchy. Technical Report No. 201, University of Würzburg, Department of Computer Science, 1998.
43. [Se01] V.L. Selivanov. Relating automata-theoretic hierarchies to complexity-theoretic hierarchies. Proc. 13th Conference on Fundamentals of Computation Theory 2001, Lecture Notes in Computer Science Vol. 2138, 2001, 323-334.
44. Final version: Theoret. Informatics Appl. 36 (2002), 29-42.
45. [SW04] V.L. Selivanov, K.W. Wagner. A reducibility for the dot-depth hierarchy. Proc. of the 29th Intern. Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science Vol. 3153, 2004, 783-793.
46. [Tr02] St. Travers. Blattsprachen Komplexitätsklassen: Über Turing-Abschluss und Counting-Operatoren Studienarbeit, Universität Würzburg, Dezember 2002.
47. [Ve93] N.K. Vereshchagin. Relativizable and non-relativizable theorems in the polynomial theory of algorithms. Izvestiya Rossiiskoi Akademii Nauk, 57 (1993), 51-90 (in Russian).
48. [Ve98] H. Veith. Succinct Representation, Leaf Languages and Projection Reductions. Information and Computation 142 (1998), 207-236.
49. Preliminary version: "Succinct Representation and Leaf Languages" in: Proc. 11th Annual IEEE Conference on Computational Complexity (CCC), 1996, 118-126.
50. [Vo98] H. Vollmer. Relating polynomial time to constant depth. Theoretial Computer Science 207 (1998), 159-170
51. [Vo99] H. Vollmer. Uniform characterizations of complexity classes. ACM SIGACT-Newsletter 30(1), 1999, 17-27.
52. [Vo03] H. Vollmer. Complexity theory made easy - the formal language approach to the definition of complexity classes. Proc. 7th Developments in Language Theory, 2003.
53. [Vo04] H. Vollmer. The Leaf Language Homepage. http://www.thi.uni- hannover.de/forschung/leafl/
54. [Wa01] K.W. Wagner. A reducibility and complete sets for the dot-depth hierarchy. Manuscript.
55. [Wa04] K.W. Wagner. New BCSV theorems. Technical Report 337, Institut für Informatik, Universität Würzburg.