Modeling literal morphisms by shuffle

DOI10.1007/PL00005943zbMath0982.20056OpenAlexW2047685009MaRDI QIDQ1383303

Zoltán Ésik, Imre Simon

Publication date: 9 December 2001

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00005943

zbMATH Keywords

varieties of regular languagesliteral morphismsshuffle operations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (8)

Shuffle on positive varieties of languages ⋮ Regularity Conditions for Iterated Shuffle on Commutative Regular Languages ⋮ Shuffle product of regular languages: results and open problems ⋮ Efficiency of automata in semi-commutation verification techniques ⋮ On shuffle products, acyclic automata and piecewise-testable languages ⋮ Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups ⋮ The expressive power of the shuffle product ⋮ A Robust Class of Regular Languages

This page was built for publication: Modeling literal morphisms by shuffle