Shuffle on trajectories over finite array languages

DOI10.1007/978-3-642-21073-0_24MaRDI QIDQ3003541zbMATH OpenOpenAlexFDO

Authors H. Geetha, Thiyagarajan Kalyani, A. S. Prasanna Venkatesan, Durairaj Gnanaraj Thomas

Publication date 27 May 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21073-0_24

zbMATH Keywords

array languagesshuffletrajectories

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1179977
• scientific article; zbMATH DE number 1101590
• scientific article; zbMATH DE number 1860697
• Shuffle on array languages generated by array grammars
• Shuffle on trajectories: Syntactic constraints

Cites work

• Algebraic properties of the shuffle over \(\omega\)-trajectories
• PARALLEL CONTEXTUAL ARRAY GRAMMARS AND LANGUAGES
• Picture languages with array rewriting rules
• Shuffle on trajectories: Syntactic constraints

Cited in

(7)

• Shuffle on trajectories: Syntactic constraints
• P systems with shuffle operation and catalytic-like rules
• Array P system with shuffle on trajectories
• Finding shuffle words that represent optimal scheduling of shared memory access
• Shuffle on array languages generated by array grammars
• Finding shuffle words that represent optimal scheduling of shared memory access
• scientific article; zbMATH DE number 1860697 (Why is no real title available?)

This page was built for publication: Shuffle on trajectories over finite array languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003541)