On notions of regularity for data languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4639 LNCS, Issue , 2007, Pages 88-99

  Björklund, Henrik ^a   Schwentick, Thomas ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; MATHEMATICAL MODELS; MODEL CHECKING; XML;

DATA AUTOMATA; DATA LANGUAGES; DATA STRINGS; FINITE ALPHABET STRINGS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 38149006866     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74240-1_9     Document Type: Conference Paper

References (17)

1. Abdulla, P, Jonsson, B., Nilsson, M., Saksena, M.: A survey of regular model checking. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 35-48. Springer, Heidelberg (2004)
2. Alur, R., Madhusudan, P.: Adding nesting structure to words. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 1-13. Springer, Heidelberg (2006)
3. Arenas, M., Fan, W., Libkin, L.: Consistency of XML specifications. In: Bertossi, L., Hunter, A., Schaub, T. (eds.) Inconsistency Tolerance. LNCS, vol. 3300, pp. 15-41. Springer, Heidelberg (2005)
4. 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)
5. Bouyer, P., Petit, A., Thérien, D.: An algebraic approach to data languages and timed languages. Information and Computation 182(2), 137-162 (2003)
6. Demri, S., Lazić, R.: LTL with the freeze quantifier and register automata. In: LICS'06, pp. 17-26 (2006)
7. Downey, R.G.: Parameterized complexity for the skeptic. In: CCC'03, pp. 147-169 (2003)
8. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
9. Emerson, E., Namjoshi, K.: Reasoning about rings. In: POPL'95, pp. 85-94 (1995)
10. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
11. Kaminski, M., Francez, N.: Finite-memory automata. TCS 132(2), 329-363 (1994)
12. Kaminski, M., Tan, T.: Regular expressions for languages over infinite alphabets. In: Chwa, K.-Y., Munro, J.I.J, (eds.) COCOON 2004. LNCS, vol. 3106, pp. 171-178. Springer, Heidelberg (2004)
13. Neven, F.: Automata, logic, and XML. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 2-26. Springer, Heidelberg (2002)
14. Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM transactions on computational logic 15(3), 403-435 (2004)
15. Sakamoto, H., Ikeda, D.: Intractability of decision problems for finite-memory automata. TCS 231(2), 297-308 (2000)
16. 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)
17. Wilke, T.: Automaten und Logiken zur Beschreibung zeitabhängiger Systeme. PhD thesis, University of Kiel (1994)