메뉴 건너뛰기
Information Processing Letters
Volumn 104, Issue 5, 2007, Pages 164-167
A note on emptiness for alternating finite automata with a one-letter alphabet
Author keywords

Alternating finite automaton; Computational complexity; Emptiness
Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA PROCESSING; PROBLEM SOLVING;
EID: 34548222502     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.06.006     Document Type: Article
Times cited : (36)
References (9)
  • 2
    • 0347404302 scopus 로고
    • On a family of L languages resulting from systolic tree automata
    • Culik K., Gruska J., and Salomaa A. On a family of L languages resulting from systolic tree automata. Theoret. Comput. Sci. 23 3 (1983) 231-242
    • (1983) Theoret. Comput. Sci. , vol.23 , Issue.3 , pp. 231-242
    • Culik, K.1    Gruska, J.2    Salomaa, A.3
  • 3
    • 33750316597 scopus 로고    scopus 로고
    • On emptiness and counting for alternating finite automata
    • Dassow J., Rozenberg G., and Salomaa A. (Eds). Magdeburg, Germany, 17-21 July 1995, World Scientific
    • Holzer M. On emptiness and counting for alternating finite automata. In: Dassow J., Rozenberg G., and Salomaa A. (Eds). Proceedings of Developments in Language Theory II. Magdeburg, Germany, 17-21 July 1995 (1996), World Scientific 88-97
    • (1996) Proceedings of Developments in Language Theory II , pp. 88-97
    • Holzer, M.1
  • 4
    • 17344374950 scopus 로고    scopus 로고
    • DP lower bounds for equivalence-checking and model-checking of one-counter automata
    • Jančar P., Kučera A., Moller F., and Sawa Z. DP lower bounds for equivalence-checking and model-checking of one-counter automata. Information and Computation 188 (2004) 1-19
    • (2004) Information and Computation , vol.188 , pp. 1-19
    • Jančar, P.1    Kučera, A.2    Moller, F.3    Sawa, Z.4
  • 5
    • 0013395658 scopus 로고
    • A note on the space complexity of some decision problems for finite automata
    • Jiang T., and Ravikumar B. A note on the space complexity of some decision problems for finite automata. Inf. Process. Lett. 40 1 (1991) 25-31
    • (1991) Inf. Process. Lett. , vol.40 , Issue.1 , pp. 25-31
    • Jiang, T.1    Ravikumar, B.2
  • 6
    • 0029236839 scopus 로고
    • Completeness results concerning systolic tree automata and E0L languages
    • Monti A., and Roncato A. Completeness results concerning systolic tree automata and E0L languages. Inf. Process. Lett. 53 1 (1995) 11-16
    • (1995) Inf. Process. Lett. , vol.53 , Issue.1 , pp. 11-16
    • Monti, A.1    Roncato, A.2
  • 8
    • 33745790034 scopus 로고    scopus 로고
    • Parity games played on transition graphs of one-counter processes
    • Proceedings of FOSSACS 2006. Aceto L., and Ingólfsdóttir A. (Eds), Springer
    • Serre O. Parity games played on transition graphs of one-counter processes. In: Aceto L., and Ingólfsdóttir A. (Eds). Proceedings of FOSSACS 2006. Lecture Notes in Computer Science vol. 3921 (2006), Springer 337-351
    • (2006) Lecture Notes in Computer Science , vol.3921 , pp. 337-351
    • Serre, O.1
  • 9
    • 33750373069 scopus 로고    scopus 로고
    • Visibly pushdown automata: From language equivalence to simulation and bisimulation
    • Proceedings of CSL 2006. Ésik Z. (Ed), Springer
    • Srba J. Visibly pushdown automata: From language equivalence to simulation and bisimulation. In: Ésik Z. (Ed). Proceedings of CSL 2006. Lecture Notes in Computer Science vol. 4207 (2006), Springer 89-103
    • (2006) Lecture Notes in Computer Science , vol.4207 , pp. 89-103
    • Srba, J.1

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