메뉴 건너뛰기




Volumn 2706, Issue , 2003, Pages 483-498

Recognizing Boolean closed A-tree languages with membership conditional rewriting mechanism

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FORESTRY;

EID: 84947742359     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44881-0_34     Document Type: Conference Paper
Times cited : (16)

References (20)
  • 5
    • 0025596345 scopus 로고
    • The Theory of Ground Rewrite Systems is Decidable
    • Philadelphia (Pennsylvania)
    • M. Dauchet and S. Tison: The Theory of Ground Rewrite Systems is Decidable, Proc. of 5th LICS, Philadelphia (Pennsylvania), pp. 242–248, 1990.
    • (1990) Proc. Of 5Th LICS , pp. 242-248
    • Dauchet, M.1    Tison, S.2
  • 10
    • 84947773356 scopus 로고    scopus 로고
    • Term Rewriting with Sequences
    • Hagenberg (Austria), Draft included in technical report 97–20, RISC - Linz
    • M. Hamana: Term Rewriting with Sequences, Proc. of 1st Theorema Workshop, Hagenberg (Austria), 1997. Draft included in technical report 97–20, RISC - Linz.
    • (1997) Proc. Of 1St Theorema Workshop
    • Hamana, M.1
  • 11
    • 0024091298 scopus 로고
    • Nondeterministic Space is Closed Under Complementation
    • N. Immerman: Nondeterministic Space is Closed Under Complementation, SIAM Journal on Computing 17(5), pp. 935–938, 1988.
    • (1988) SIAM Journal on Computing , vol.17 , Issue.5 , pp. 935-938
    • Immerman, N.1
  • 12
    • 0009977641 scopus 로고
    • Classes of Languages and Linear Bounded Automata
    • S.Y. Kuroda: Classes of Languages and Linear Bounded Automata, Information and Control 7, pp. 207–223, 1964.
    • (1964) Information and Control , vol.7 , pp. 207-223
    • Kuroda, S.Y.1
  • 15
    • 0000501099 scopus 로고    scopus 로고
    • Aspects of Classical Language Theory
    • (Chapter 4), Springer-Verlag
    • A. Mateescu and A. Salomaa: Aspects of Classical Language Theory, Handbook of Formal Languages 1, pp. 175–251 (Chapter 4), Springer-Verlag, 1996.
    • (1996) Handbook of Formal Languages 1 , pp. 175-251
    • Mateescu, A.1    Salomaa, A.2
  • 16
    • 84944240660 scopus 로고    scopus 로고
    • Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories
    • H. Ohsaki: Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories, Proc. of 15th CSL, Paris (France), LNCS 2142, pp. 539–553, 2001.
    • (2001) Proc. Of 15Th CSL, Paris (France), LNCS , vol.2142 , pp. 539-553
    • Ohsaki, H.1
  • 17
    • 84947242793 scopus 로고    scopus 로고
    • Decidability and Closure Properties of Equational Tree Languages
    • H. Ohsaki and T. Takai: Decidability and Closure Properties of Equational Tree Languages, Proc. of 13th RTA, Copenhagen (Denmark), LNCS 2378, pp. 114–128, 2002.
    • (2002) Proc. Of 13Th RTA, Copenhagen (Denmark), LNCS , vol.2378 , pp. 114-128
    • Ohsaki, H.1    Takai, T.2
  • 19
    • 84947768859 scopus 로고    scopus 로고
    • technical report AIST–PS–2003–001, Programming Science Group, AIST, The revised version with the new title (Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism) is
    • H. Ohsaki, H. Seki, and T. Takai: Recognizable A-Tree Languages are Boolean Closed, technical report AIST–PS–2003–001, Programming Science Group, AIST, 2003. The revised version with the new title (Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism) is available from http://staff.aist.go.jp/hitoshi.ohsaki/rta2003.ps.gz
    • (2003) Recognizable A-Tree Languages are Boolean Closed
    • Ohsaki, H.1    Seki, H.2    Takai, T.3
  • 20
    • 18744378669 scopus 로고
    • Membership Conditional Term Rewriting Systems
    • Y. Toyama: Membership Conditional Term Rewriting Systems, Trans. of IEICE E72(11), pp. 1224–1229, 1989.
    • (1989) Trans. Of IEICE , vol.72 , Issue.11 , pp. 1224-1229
    • Toyama, Y.1


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