We consider unordered XML, where the relative order among siblings is ignored, and
propose two simple yet practical schema formalisms: disjunctive multiplicity schemas (DMS) …

We investigate schema languages for unordered XML having no relative order among
siblings. First, we propose unordered regular expressions (UREs), essentially regular …

Language models that use interleaving, or shuffle, operators have applications in various
areas of computer science, including system verification, plan recognition, and natural …

Multidimensional Dyck languages generalize the language of balanced brackets to
alphabets of size> 2. Words contain each alphabet symbol with the same multiplicity. In …

Since shuffle introduced into regular expressions makes the membership problem NP-hard,
and an efficient membership algorithm facilitates processing many membership-based …

Learning finite automata has been a popular topic. Shuffle has been applied in information
systems. Since shuffle introduced into finite automata makes the membership problem NP …

Permutation grammars are an extension of context-free grammars with rules having the
same symbols on both sides but possibly in a different order. An example of a permutation …

Properties of Languages with Catenation and Shuffle | Fundamenta Informaticae skip to main
content ACM Digital Library home ACM home Google, Inc. (search) Advanced Search Browse …

Specifying a database query using a formal query language is typically a challenging task
for non-expert users. In the context of big data, this problem becomes even harder because …

We present an open source discrete event simulator, FAS Simulator, for generating
interleaved process traces of Flexible Assembly Systems. The simulation includes plausible …