Trajectory-Based Embedding Relations

Authors:
Michael Domaratzki
Affiliations:
School of Computing, Queen's University, Kingston, ON K7L 3N6, Canada
Venue:
Fundamenta Informaticae
Year:
2004

Citing 8
Cited 1

Handbook of formal languages, vol. 1: word, language, grammar

Handbook of formal languages, vol. 1: word, language, grammar
Regular languages

Handbook of formal languages, vol. 1
Combinatorics of words

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
Trajectory-based codes

Acta Informatica
Deletion along trajectories

Theoretical Computer Science

Interpreted Trajectories

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.