메뉴 건너뛰기




Volumn 4423 LNCS, Issue , 2007, Pages 168-182

Tree automata with memory, visibility and structural constraints

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; CONSTRAINT THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

EID: 37149055031     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71389-0_13     Document Type: Conference Paper
Times cited : (7)

References (15)
  • 3
    • 85029633250 scopus 로고
    • Equality and Disequality Constraints on Direct Subterms in Tree Automata
    • 9th Symp. on Theoretical Aspects of Computer Science, STACS, of, Springer
    • B. Bogaert and S. Tison. Equality and Disequality Constraints on Direct Subterms in Tree Automata. In 9th Symp. on Theoretical Aspects of Computer Science, STACS, volume 577 of LNCS, pages 161-171. Springer, 1992.
    • (1992) LNCS , vol.577 , pp. 161-171
    • Bogaert, B.1    Tison, S.2
  • 4
    • 15744388991 scopus 로고    scopus 로고
    • Tree automata with one memory, set constraints and cryptographic protocols
    • Feb
    • H. Comon and V. Cortier. Tree automata with one memory, set constraints and cryptographic protocols. Theoretical Computer Science, 331(1):143-214, Feb. 2005.
    • (2005) Theoretical Computer Science , vol.331 , Issue.1 , pp. 143-214
    • Comon, H.1    Cortier, V.2
  • 6
    • 0344981314 scopus 로고    scopus 로고
    • Ground reducibility is exptime-complete
    • H. Comon and F. Jacquemard. Ground reducibility is exptime-complete. Information and Computation, 187(1):123-153, 2003.
    • (2003) Information and Computation , vol.187 , Issue.1 , pp. 123-153
    • Comon, H.1    Jacquemard, F.2
  • 7
    • 84858513843 scopus 로고    scopus 로고
    • H. Comon-Lundh, F. Jacquemard, and N. Perrin. Tree automata with memory, visibility and structural constraints. Technical Report LSV-07-01, Laboratoire Spécification et Vérification, Jan. 2007. 25 pages.
    • H. Comon-Lundh, F. Jacquemard, and N. Perrin. Tree automata with memory, visibility and structural constraints. Technical Report LSV-07-01, Laboratoire Spécification et Vérification, Jan. 2007. 25 pages.
  • 8
    • 0028769280 scopus 로고
    • Bottom-up tree push-down automata: Classification and connection with rewrite systems
    • J.-L. Coquidé, M. Dauchet, R. Gilleron, and S. Vagvölgyi. Bottom-up tree push-down automata: classification and connection with rewrite systems. Theoretical Computer Science, 127(1):69-98, 1994.
    • (1994) Theoretical Computer Science , vol.127 , Issue.1 , pp. 69-98
    • Coquidé, J.-L.1    Dauchet, M.2    Gilleron, R.3    Vagvölgyi, S.4
  • 11
    • 33745789640 scopus 로고    scopus 로고
    • Automata-based verification of programs with tree updates
    • Proc. 12th Intern. Conf. on Tools and Algorithms for the Construction and Analysis of Systems TACAS'06, of, April
    • P. Habermehl, R. Iosif, and T. Vojnar. Automata-based verification of programs with tree updates. In Proc. 12th Intern. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'06), volume 3920 of LNCS, April 2006.
    • (2006) LNCS , vol.3920
    • Habermehl, P.1    Iosif, R.2    Vojnar, T.3
  • 14


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