Process algebra
Polynomial closure of group languages and open sets of the Hall topology
ICALP '94 Selected papers from the 21st international colloquium on Automata, languages and programming
Automata, Languages, and Machines
Automata, Languages, and Machines
Decidable first-order transition logics for PA-processes
Information and Computation
Shuffle of Words and Araucaria Trees
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
When Does Partial Commutative Closure Preserve Regularity?
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Constrained Reachability of Process Rewrite Systems
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Decidable first-order transition logics for PA-processes
Information and Computation
On the minimal automaton of the shuffle of words and araucarias
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Shuffle of Words and Araucaria Trees
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Regular languages and partial commutations
Information and Computation
Araucaria Trees: Construction and Grafting Theorems
Fundamenta Informaticae
| Hi-index | 0.00 |
The notion of sequential and parallel decomposition of a language over a set of languages was introduced by Schnoebelen. A language is decomposable if it belongs to a finite set of languages S such that each member of S admits a sequential and parallel decomposition over S. We disprove a conjecture of Schnoebelen concerning decomposable languages and establish some new properties of these languages.