Properties of Languages with Catenation and Shuffle

Authors:
Manfred Kudlek;Nils Erik Flick
Affiliations:
University of Hamburg, Germany;University of Oldenburg, Germany. flick@informatik.uni-oldenburg.de
Venue:
Fundamenta Informaticae - Dedicated to the Memory of Professor Manfred Kudlek
Year:
2014

Citing 8
Cited 0

Semirings, automata, languages

Semirings, automata, languages
Shuffle languages are in P

Theoretical Computer Science
Shuffle languages, Petri nets, and context-sensitive grammars

Communications of the ACM
Toward a Formal Macroset Theory

WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Recognizing shuffled languages

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
On Deadlock and Fairness Decision Problems for Computations on Client-server Systems

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
On a hierarchy of languages with catenation and shuffle

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
On Semilinear Sets over Commutative Semirings

Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present structural properties of languages constructed with catenation and shuffle, comprising iteration lemmata and closure properties of the language classes, as well as decidability results that follow.