Abstract
In this paper, we develop a theory that studies words with nested data values with the help of shuffle expressions. We study two cases, which we call “ordered” and “unordered”. In the unordered case, we show that emptiness (of the two related problems) is decidable. In the ordered case, we prove undecidability. As a proof vehicle for the latter, we introduce the notion of higher-order multicounter automata.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Björklund, H., Schwentick, T.: On notions of regularity for data languages. In: FCT 2007 (to appear, 2007)
Bojańczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: LICS 2006, pp. 7–16 (2006)
Bouyer, P., Petit, A., Thérien, D.: An algebraic approach to data languages and timed languages. Information and Computation 182(2), 137–162 (2003)
Demri, S., Lazić, R.: LTL with the freeze quantifier and register automata. In: LICS 2006, pp. 17–26 (2006)
Gischer, J.: Shuffle languages, petri nets, and context-sensitive grammars. Communications of the ACM 24(9), 597–605 (1981)
Jedrzejowicz, J., Szepietowski, A.: Shuffle languages are in P. TCS 250, 31–53 (2001)
Kaminski, M., Francez, N.: Finite-memory automata. TCS 132(2), 329–363 (1994)
Lomazova, I.A., Schnoebelen, P.: Some decidability results for nested petri nets. In: PSI 1999, pp. 208–220 (2000)
Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM transactions on computational logic 15(3), 403–435 (2004)
Parikh, R.: On context-free languages. Journal of the ACM, 570–581 (1966)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Björklund, H., Bojańczyk, M. (2007). Shuffle Expressions and Words with Nested Data. In: Kučera, L., Kučera, A. (eds) Mathematical Foundations of Computer Science 2007. MFCS 2007. Lecture Notes in Computer Science, vol 4708. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74456-6_66
Download citation
DOI: https://doi.org/10.1007/978-3-540-74456-6_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74455-9
Online ISBN: 978-3-540-74456-6
eBook Packages: Computer ScienceComputer Science (R0)