메뉴 건너뛰기




Volumn 38, Issue 2, 2008, Pages 658-701

Tree-walking automata do not recognize all regular languages

Author keywords

Formal languages; Tree automata; Tree walking automata

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; FORMAL LANGUAGES; LINGUISTICS; QUERY LANGUAGES; ROBOTS; SEQUENTIAL MACHINES; TRANSLATION (LANGUAGES);

EID: 55249111324     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/050645427     Document Type: Conference Paper
Times cited : (30)

References (12)
  • 1
    • 0000535810 scopus 로고
    • Translations on a context-free grammar
    • A. V. AHO AND J. D. ULLMAN, Translations on a context-free grammar, Inform. and Control, 19 (1971), pp. 439-475.
    • (1971) Inform. and Control , vol.19 , pp. 439-475
    • AHO, A.V.1    ULLMAN, J.D.2
  • 2
    • 30844466797 scopus 로고    scopus 로고
    • 1 -bounded TWA cannot be determinized
    • Foundations of Software Technology and Theoretical Computer Science, Springer-Verlag, Berlin
    • M. BOJAŃCZYK, 1 -bounded TWA cannot be determinized, in Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Comput. Sci. 2914, Springer-Verlag, Berlin, 2003, pp. 62-73.
    • (2003) Lecture Notes in Comput. Sci , vol.2914 , pp. 62-73
    • BOJAŃCZYK, M.1
  • 3
    • 30844470639 scopus 로고    scopus 로고
    • Tree-walking automata cannot he determinized
    • M. BOJAŃCZYK AND T. COLCOMBET, Tree-walking automata cannot he determinized, Theoret. Comput. Sci., 350 (2006), pp. 164-173.
    • (2006) Theoret. Comput. Sci , vol.350 , pp. 164-173
    • BOJAŃCZYK, M.1    COLCOMBET, T.2
  • 8
  • 9
    • 0019551297 scopus 로고
    • Parallel two-way automata on directed ordered acyclic graphs
    • T. KAMIMURA AND G. SLUTZKI, Parallel two-way automata on directed ordered acyclic graphs, Inform, and Control, 49 (1981), pp. 10-51.
    • (1981) Inform, and Control , vol.49 , pp. 10-51
    • KAMIMURA, T.1    SLUTZKI, G.2
  • 10
  • 11
    • 0038486147 scopus 로고    scopus 로고
    • On the power of tree-walking automata
    • F. NEVEN AND T. SCHWENTICK, On the power of tree-walking automata, Inform, and Comput., 183 (2003), pp. 86-103.
    • (2003) Inform, and Comput , vol.183 , pp. 86-103
    • NEVEN, F.1    SCHWENTICK, T.2
  • 12
    • 33745593164 scopus 로고
    • Ph.D. thesis, Institut für Informatik und Praktische Mathematik, Universität Kiel, Kiel, Germany
    • A. POTTHOFF, Logische Klassifizierung regulärer Baumsprachen, Ph.D. thesis, Institut für Informatik und Praktische Mathematik, Universität Kiel, Kiel, Germany, 1994.
    • (1994) Logische Klassifizierung regulärer Baumsprachen
    • POTTHOFF, A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.