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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Björklund, H., & Bojańczyk, M. (2007). Shuffle expressions and words with nested data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4708 LNCS, pp. 750–761). Springer Verlag. https://doi.org/10.1007/978-3-540-74456-6_66
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
