On notions of regularity for data languages

Theoretical Computer Science

Volumn 411, Issue 4-5, 2010, Pages 702-715

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

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATON MODEL; CLOSURE PROPERTY; DATA STRINGS; DATA VALUES; EQUIVALENT MODEL; EXPRESSIVE POWER; FINITE ALPHABET; INFINITE DOMAINS; XML DATABASE;

AUTOMATA THEORY; LINGUISTICS; MARKUP LANGUAGES; TRANSLATION (LANGUAGES);

MODEL CHECKING;

EID: 72949097850     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.10.009     Document Type: Article

References (19)

1. Abdulla P., Jonsson B., Nilsson M., and Saksena M. A survey of regular model checking. CONCUR'04. LNCS vol. 3170 (2004) 35-48
2. Arenas M., Fan W., and Libkin L. Consistency of XML specifications. Inconsistency Tolerance. LNCS vol. 3300 (2005) 15-41
3. M. Bojańczyk, A. Muscholl, T. Schwentick, L. Segoufin, C. David, Two-variable logic on words with data, in: LICS'06, 2006, pp. 7-16
4. Bouyer P., Petit A., and Thérien D. An algebraic approach to data languages and timed languages. Information and Computation 182 2 (2003) 137-162
5. S. Demri, R. Lazić, LTL with the freeze quantifier and register automata, in: LICS'06, 2006, pp. 17-26
6. R.G. Downey, Parameterized complexity for the skeptic, in: CCC'03, 2003, pp. 147-169
7. Downey R.G., and Fellows M.R. Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science 141 1-2 (1995) 109-131
8. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer
9. E. Emerson, K. Namjoshi, Reasoning about rings, in: POPL'95, 1995, pp. 85-94
10. Flum J., and Grohe M. Parameterized Complexity Theory (2006), Springer
11. Hopcroft J., and Ullman J. Introduction to Automata Theory, Languages, and Computation (1979), Addison-Wesley
12. Kaminski M., and Francez N. Finite-memory automata. Theoretical Computer Science 132 2 (1994) 329-363
13. Kaminski M., and Tan T. Regular expressions for languages over infinite alphabets. In: Chwa K., and Munro J. (Eds). COCOON 04. LNCS vol. 3106 (2004) 171-178
14. Neven F. Automata, logic, and XML. CSL '02. LNCS vol. 2471 (2002) 2-26
15. Neven F., Schwentick T., and Vianu V. Finite state machines for strings over infinite alphabets. ACM Transactions on Computational Logic 15 3 (2004) 403-435
16. K. Reinhardt, Counting as method, model and task in theoretical computer science, Habilitation Thesis, University of Tübingen, 2005
17. Sakamoto H., and Ikeda D. Intractability of decision problems for finite-memory automata. Theoretical Computer Science 231 2 (2000) 297-308
18. Segoufin L. Automata and logics for words and trees over an infinite alphabet. Computer Science Logic (CSL). LNCS vol. 4207 (2006) 41-57
19. T. Wilke, Automaten und Logiken zur Beschreibung zeitabhängiger Systeme, Ph.D. Thesis, University of Kiel, 1994