Algebraic properties of the shuffle over \(\omega\)-trajectories

DOI10.1016/S0020-0190(01)00153-3zbMath1032.68094OpenAlexW1998374774MaRDI QIDQ1603372

A. Kadrie, K. G. Subramanian, D. Gnanaraj Thomas, V. Rajkumar Dare

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00153-3

zbMATH Keywords

trajectoryInfinite wordFormal languagesShuffle

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Codes defined by multiple sets of trajectories ⋮ Algebraic properties of substitution on trajectories ⋮ Bond-free DNA language classes ⋮ Shuffle on Trajectories over Finite Array Languages

Cites Work

• Une généralisation des théorèmes de Higman et de Simon aux mots infinis
• Shuffle on trajectories: Syntactic constraints
• Unnamed Item

This page was built for publication: Algebraic properties of the shuffle over \(\omega\)-trajectories