-
1
-
-
38049052743
-
-
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)
-
-
-
-
2
-
-
34547260240
-
Two-variable logic on words with data
-
Bojańczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: LICS'06, pp. 7-16 (2006)
-
(2006)
LICS'06
, pp. 7-16
-
-
Bojańczyk, M.1
Muscholl, A.2
Schwentick, T.3
Segoufin, L.4
David, C.5
-
3
-
-
0038176921
-
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
-
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
-
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
-
-
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
-
-
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)
-
-
-
-
9
-
-
3142676414
-
Finite state machines for strings over infinite alphabets
-
Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM transactions on computational logic 15(3), 403-435 (2004)
-
(2004)
ACM transactions on computational logic
, vol.15
, Issue.3
, pp. 403-435
-
-
Neven, F.1
Schwentick, T.2
Vianu, V.3
-
10
-
-
0000457926
-
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
-
-
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)
-
-
-
|