Theoretical Computer Science
Journal of the ACM (JACM)
Theoretical Computer Science
Shuffle languages, Petri nets, and context-sensitive grammars
Communications of the ACM
Some Decidability Results for Nested Petri Nets
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
An algebraic approach to data languages and timed languages
Information and Computation
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Two-Variable Logic on Words with Data
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
LTL with the Freeze Quantifier and Register Automata
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
On notions of regularity for data languages
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Model checking memoryful linear-time logics over one-counter automata
Theoretical Computer Science
Algorithmic analysis of array-accessing programs
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Two variables and two successors
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Two-variable logic on data words
ACM Transactions on Computational Logic (TOCL)
Recognizing shuffled languages
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
P automata: concepts, results, and new aspects
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Algorithmic analysis of array-accessing programs
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
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.