Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1
Handbook of formal languages, vol. 1
Shuffle on trajectories: syntactic constraints
Theoretical Computer Science
Algebraic properties of the shuffle over ω-trajectories
Information Processing Letters
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Acta Informatica
Theoretical Computer Science
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Codes defined by multiple sets of trajectories
Theoretical Computer Science
Algebraic properties of substitution on trajectories
Theoretical Computer Science
Hairpin structures defined by DNA trajectories
DNA'06 Proceedings of the 12th international conference on DNA Computing
Semantic shuffle on and deletion along trajectories
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Hi-index | 0.00 |
We generalize the embedding order to shuffle on trajectories and examine its properties. We give general characterizations of reflexivity, transitivity, anti-symmetry and other properties of binary relations, and investigate the associated decision problems. We also examine the property of convexity of a language with respect to these generalized embedding relations.