On a hierarchy of languages with catenation and shuffle

Authors:
Nils Erik Flick;Manfred Kudlek
Affiliations:
Fachbereich Informatik, MIN-Fakultät, Universität Hamburg, Germany;Fachbereich Informatik, MIN-Fakultät, Universität Hamburg, Germany
Venue:
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Year:
2012

Citing 7
Cited 2

Semirings, automata, languages

Semirings, automata, languages
Iteration lemmata for certain classes of word, trace and graph languages

Fundamenta Informaticae
Shuffle languages, Petri nets, and context-sensitive grammars

Communications of the ACM
Shuffle Quotient and Decompositions

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Algebraic Theory of Automata & Languages

Algebraic Theory of Automata & Languages
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages
On Semilinear Sets over Commutative Semirings

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

A Hierarchy of Languages with Catenation and Shuffle

Fundamenta Informaticae - Concurrency, Specification and Programming
Properties of Languages with Catenation and Shuffle

Fundamenta Informaticae - Dedicated to the Memory of Professor Manfred Kudlek

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present basic structures, normal forms, and a hierarchy of languages based on catenation, shuffle and their iterations, defined by algebraic closure or least fix point solution of equation systems.