Result 1 to 16 of 16 total
Leaf languages and string compression. (English)
Inf. Comput. 209, No. 6, 951-965 (2011).
1
Machines that can output empty words. (English)
Theory Comput. Syst. 44, No. 3, 369-390 (2009).
2
Leaf languages and string compression. (English)
Hariharan, Ramesh (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2008), December 9‒11, 2008, Bangalore, India. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-08-8). LIPICS ‒ Leibniz International Proceedings in Informatics 2, 292-303, electronic only (2008).
3
Languages polylog-time reducible to dot-depth 1/2. (English)
J. Comput. Syst. Sci. 73, No. 1, 36-56 (2007).
4
On small hard leaf languages. (English)
Jędrzejowicz, Joanna (ed.) et al., Mathematical foundations of computer science 2005. 30th international symposium, MFCS 2005, Gdansk, Poland, August 29‒September 2, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28702-7/pbk). Lecture Notes in Computer Science 3618, 781-792 (2005).
5
A reducibility for the dot-depth hierarchy. (English)
Theor. Comput. Sci. 345, No. 2-3, 448-472 (2005).
6
Functions computable in polynomial space. (English)
Inf. Comput. 198, No. 1, 56-70 (2005).
7
A reducibility for the dot-depth hierarchy. (English)
Fiala, Jiří (ed.) et al., Mathematical foundations of computer Science 2004. 29th international symposium, MFCS 2004, Prague, Czech Republic, August 22‒27, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22823-3/pbk). Lecture Notes in Computer Science 3153, 783-793 (2004).
8
Relating automata-theoretic hierarchies to complexity-theoretic hierarchies. (English)
Theor. Inform. Appl. 36, No.1, 29-42 (2002).
9
Finite automata with generalized acceptance criteria. (English)
Discrete Math. Theor. Comput. Sci. 4, No.2, 179-192 p., electronic only (2001).
10
Lectures on complexity theory. (Vorlesungen zur Komplexitätstheorie.) (German)
Teubner-Texte zur Informatik. 32. Stuttgart: Teubner. 312 S. DM 84.00; öS 613.00; sFr 76.00 (2000).
11
The permanent requires large uniform threshold circuits. (English)
Chic. J. Theor. Comput. Sci. 1999, Article No.7, 19 p. (1999).
12
The shapes of trees. (English)
Jiang, Tao (ed.) et al., Computing and combinatorics. 3rd annual international conference, COCOON ’97. Shanghai, China. August 20‒22, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1276, 412-421 (1997).
13
Logspace and logtime leaf languages. (English)
Inf. Comput. 129, No.1, 21-33 (1996).
14
On balanced versus unbalanced computation trees. (English)
Math. Syst. Theory 29, No.4, 411-421 (1996).
15
Arbres algébriques et programmation. (French)
Arbres en Algebre et Program., 3eme Coll. Lille 1978, 175-188 (1978).
16
Result 1 to 16 of 16 total
Start
Contact
Print
General Help
