메뉴 건너뛰기
Information Processing Letters
Volumn 94, Issue 5, 2005, Pages 231-240
Closure properties and decision problems of dag automata
Author keywords

Complementation; Determinism; Emptiness problem; Formal languages; Tree automata; Universality problem
Indexed keywords

DECISION MAKING; ERROR ANALYSIS; FORMAL LANGUAGES; MEMBERSHIP FUNCTIONS; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);
EID: 18444377894     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.02.004     Document Type: Article
Times cited : (26)
References (13)
  • 2
    • 21144453085 scopus 로고    scopus 로고
    • ACID-unification is NEXPTIME-decidable
    • Proc. MFCS'03, Springer-Verlag Berlin
    • S. Anantharaman, P. Narendran, and M. Rusinowitch ACID-unification is NEXPTIME-decidable Proc. MFCS'03 Lecture Notes in Comput. Sci. vol. 2747 2003 Springer-Verlag Berlin 169 179
    • (2003) Lecture Notes in Comput. Sci. , vol.2747 , pp. 169-179
    • Anantharaman, S.1    Narendran, P.2    Rusinowitch, M.3
  • 4
    • 0043241024 scopus 로고    scopus 로고
    • Unification of concept terms in description logics
    • F. Baader, and P. Narendran Unification of concept terms in description logics J. Symbolic Comput. 31 3 2001 277 305
    • (2001) J. Symbolic Comput. , vol.31 , Issue.3 , pp. 277-305
    • Baader, F.1    Narendran, P.2
  • 5
    • 85012112309 scopus 로고    scopus 로고
    • Path queries on compressed XML
    • Morgan Kaufmann Los Altos, CA
    • P. Buneman, M. Grohe, and C. Koch Path queries on compressed XML Proc. 29th Conf. on VLDB 2003 Morgan Kaufmann Los Altos, CA 141 152
    • (2003) Proc. 29th Conf. on VLDB , pp. 141-152
    • Buneman, P.1    Grohe, M.2    Koch, C.3
  • 6
    • 18444412516 scopus 로고    scopus 로고
    • Automata on DAG representations of finite trees
    • Max-Planck-Institut für Informatik, Saarbrücken, Germany
    • W. Charatonik, Automata on DAG representations of finite trees, Technical Report MPI-I-99-2-001, Max-Planck-Institut für Informatik, Saarbrücken, Germany
    • Technical Report , vol.MPI-I-99-2-001
    • Charatonik, W.1
  • 8
    • 84937389998 scopus 로고    scopus 로고
    • Rewriting for cryptographic protocol verification
    • Proc. 17th CADE, Springer-Verlag Berlin
    • T. Genet, and F. Klay Rewriting for cryptographic protocol verification Proc. 17th CADE Lecture Notes in Artif. Intell. vol. 1831 2000 Springer-Verlag Berlin 271 290
    • (2000) Lecture Notes in Artif. Intell. , vol.1831 , pp. 271-290
    • Genet, T.1    Klay, F.2
  • 9
    • 0042969210 scopus 로고    scopus 로고
    • Query evaluation of compressed trees
    • IEEE New York
    • M. Frick, M. Grohe, and C. Koch Query evaluation of compressed trees Proc. LICS'03 2003 IEEE New York 188 197
    • (2003) Proc. LICS'03 , pp. 188-197
    • Frick, M.1    Grohe, M.2    Koch, C.3
  • 10
    • 0004479469 scopus 로고    scopus 로고
    • Set constraints and tree automata
    • R. Gilleron, S. Tison, and M. Tommasi Set constraints and tree automata Inform. and Comput. 149 1999 1 41 cf. also Technical Report IT 292, Laboratoire-LIFL, Lille, 1996
    • (1999) Inform. and Comput. , vol.149 , pp. 1-41
    • Gilleron, R.1    Tison, S.2    Tommasi, M.3
  • 11
    • 7044246310 scopus 로고    scopus 로고
    • XPath and modal logics for finite DAGs
    • Proc. TABLEAUX 2003, Springer-Verlag Berlin
    • M. Marx XPath and modal logics for finite DAGs Proc. TABLEAUX 2003 Lecture Notes in Artif. Intell. vol. 2796 2003 Springer-Verlag Berlin 150 164
    • (2003) Lecture Notes in Artif. Intell. , vol.2796 , pp. 150-164
    • Marx, M.1

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