Variable automata over infinite alphabets

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

Volumn 6031 LNCS, Issue , 2010, Pages 561-572

  Grumberg, Orna ^a   Kupferman, Orna ^b   Sheinvald, Sarai ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED REASONING; CLASSICAL DECISION PROBLEMS; CLOSURE PROPERTY; COMPLEMENTATION; DETERMINIZATION; FINITE ALPHABET; INFINITE DOMAINS; INFINITE WORD; TRANSITION FUNCTIONS;

LINGUISTICS; ROBOTS; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 77953773956     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13089-2_47     Document Type: Conference Paper

References (15)

1. Bojánczyk, M., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and xml reasoning. J. ACM 56(3), 1-48 (2009)
2. Bojanczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: LICS, pp. 7-16. IEEE Computer Society, Los Alamitos (2006)
3. Bouajjani, A., Habermehl, P., Mayr, R.: Automatic verification of recursive procedures with one integer parameter. Theoretical Computer Science 295, 85-106 (2003)
4. Bouajjani, A., Habermehl, P., Jurski, Y., Sighireanu, M.: Rewriting systems with data. In: Csuhaj-Varj́u, E., ́Esik, Z. (eds.) FCT 2007. LNCS, vol.4639, pp. 1-22. Springer, Heidelberg (2007)
5. Brambilla, M., Ceri, S., Comai, S., Fraternali, P., Manolescu, I.: Specification and design of workflow-driven hypertexts. J. Web Eng. 1(2), 163-182 (2003)
6. Büchi, J.: On a decision method in restricted second order arithmetic. In: Int. Congress on Logic, Method, and Philosophy of Science, pp. 1-12. Stanford University Press, Stanford (1962)
7. Ceri, S., Fraternali, P., Bongio, A., Brambilla, M., Comai, S., Matera, M.: Designing Data- Intensive Web Applications. Morgan Kaufmann Publishers Inc., San Francisco (2002)
8. Demri, S., Lazic, R., Nowak, D.: On the freeze quantifier in constraint ltl: Decidability and complexity. Information and Computation 7, 2-24 (2007)
9. Kaminski, M., Zeitlin, D.: Extending finite-memory automata with non-deterministic reassignment. In: Csuhaj-Varj́u, E., ́Ezik, Z. (eds.) AFL, pp. 195-207 (2008)
10. Kaminski, M., Francez, N.: Finite-memory automata. Theoretical Computer Science 134(2), 329-363 (1994)
11. Markey, N., Schnoebelen, P.: Model checking a path. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.2761, pp. 251-265. Springer, Heidelberg (2003)
12. Neven, F., Schwentick, T., Vianu, V.: Towards regular languages over infinite alphabets. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.2136, pp. 560-572. Springer, Heidelberg (2001)
13. Shemesh, Y., Francez, N.: Finite-state unification automata and relational languages. Information and Computation 114, 192-213 (1994)
14. Tan, T.: Pebble Automata for Data Languages: Separation, Decidability, and Undecidability. PhD thesis, Technion - Computer Science Department (2009)
15. Vianu, V.: Automatic verification of database-driven systems: a new frontier. In: ICDT 2009, pp. 1-13. ACM, New York (2009)