메뉴 건너뛰기




Volumn 4708 LNCS, Issue , 2007, Pages 750-761

Shuffle expressions and words with nested data

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; PROBLEM SOLVING; THEOREM PROVING; WORD PROCESSING;

EID: 38049094692     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74456-6_66     Document Type: Conference Paper
Times cited : (22)

References (11)
  • 1
    • 38049052743 scopus 로고    scopus 로고
    • Björklund, H., Schwentick, T.: On notions of regularity for data languages. In: FCT'07 (to appear, 2007)
    • Björklund, H., Schwentick, T.: On notions of regularity for data languages. In: FCT'07 (to appear, 2007)
  • 3
    • 0038176921 scopus 로고    scopus 로고
    • An algebraic approach to data languages and timed languages
    • Bouyer, P., Petit, A., Thérien, D.: An algebraic approach to data languages and timed languages. Information and Computation 182(2), 137-162 (2003)
    • (2003) Information and Computation , vol.182 , Issue.2 , pp. 137-162
    • Bouyer, P.1    Petit, A.2    Thérien, D.3
  • 4
    • 33846800625 scopus 로고    scopus 로고
    • LTL with the freeze quantifier and register automata
    • Demri, S., Lazić, R.: LTL with the freeze quantifier and register automata. In: LICS'06, pp. 17-26 (2006)
    • (2006) LICS'06 , pp. 17-26
    • Demri, S.1    Lazić, R.2
  • 5
    • 0019608225 scopus 로고
    • Shuffle languages, petri nets, and context-sensitive grammars
    • Gischer, J.: Shuffle languages, petri nets, and context-sensitive grammars. Communications of the ACM 24(9), 597-605 (1981)
    • (1981) Communications of the ACM , vol.24 , Issue.9 , pp. 597-605
    • Gischer, J.1
  • 7
    • 0028542586 scopus 로고    scopus 로고
    • Kaminski, M., Francez, N.: Finite-memory automata. TCS 132(2), 329-363 (1994)
    • Kaminski, M., Francez, N.: Finite-memory automata. TCS 132(2), 329-363 (1994)
  • 8
    • 84943272789 scopus 로고    scopus 로고
    • Lomazova, I.A., Schnoebelen, P.: Some decidability results for nested petri nets. In: PSI'99, pp. 208-220 (2000)
    • Lomazova, I.A., Schnoebelen, P.: Some decidability results for nested petri nets. In: PSI'99, pp. 208-220 (2000)
  • 10
    • 0000457926 scopus 로고
    • On context-free languages
    • Parikh, R.: On context-free languages. Journal of the ACM, 570-581 (1966)
    • (1966) Journal of the ACM , vol.570-581
    • Parikh, R.1
  • 11
    • 33750309940 scopus 로고    scopus 로고
    • Segoufin, L.: Automata and logics for words and trees over an infinite alphabet. In: Ésik, Z. (ed.) CSL 2006. LNCS, 4207, pp. 41-57. Springer, Heidelberg (2006)
    • Segoufin, L.: Automata and logics for words and trees over an infinite alphabet. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 41-57. Springer, Heidelberg (2006)


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