메뉴 건너뛰기




Volumn 58, Issue 4, 1996, Pages 195-199

Yield-languages of two-way pushdown tree automata

Author keywords

Formal languages; Pushdown automaton; Recursively enumerable sets; Tree automaton

Indexed keywords


EID: 30244481481     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00048-8     Document Type: Article
Times cited : (2)

References (10)
  • 1
    • 84945708842 scopus 로고
    • Indexed grammars - An extension of context-free grammars
    • A.V. Aho, Indexed grammars - An extension of context-free grammars, J. ACM 15 (1968) 647-671.
    • (1968) J. ACM , vol.15 , pp. 647-671
    • Aho, A.V.1
  • 2
    • 0018457668 scopus 로고
    • A purely homomorphic characterization of recursively enumerable sets
    • K. Culik II, A purely homomorphic characterization of recursively enumerable sets, J. ACM 26 (1979) 345-350.
    • (1979) J. ACM , vol.26 , pp. 345-350
    • Culik K. II1
  • 6
    • 0000971508 scopus 로고
    • Pushdown tree automata
    • I. Guessarian, Pushdown tree automata. Math. Systems Theory 16 (1983) 237-263.
    • (1983) Math. Systems Theory , vol.16 , pp. 237-263
    • Guessarian, I.1
  • 7
    • 0028769253 scopus 로고
    • On two-way tree automata
    • 71 E. Moriya, On two-way tree automata, Inform. Process. Lett. 50 (1994) 117-121.
    • (1994) Inform. Process. Lett. , vol.50 , pp. 117-121
    • Moriya, E.1
  • 9
    • 0001412532 scopus 로고
    • Alternating tree automata
    • G. Slutzki, Alternating tree automata, Theoret. Comput. Sci. 41 (1985) 305-318.
    • (1985) Theoret. Comput. Sci. , vol.41 , pp. 305-318
    • Slutzki, G.1
  • 10
    • 0027110166 scopus 로고
    • Top-down tree transducers with two-way tree walking look-ahead
    • S. Vágvölgyi, Top-down tree transducers with two-way tree walking look-ahead, Theoret. Comput. Sci. 93 (1992) 43-74.
    • (1992) Theoret. Comput. Sci. , vol.93 , pp. 43-74
    • Vágvölgyi, S.1


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