You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

Trajectory-Based Embedding Relations

Article type: Research Article

Authors: Domaratzki, Michael

Affiliations: School of Computing, Queen's University, Kingston, ON K7L 3N6, Canada

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.

Keywords: embedding order, shuffle on trajectories, convexity

Journal: Fundamenta Informaticae, vol. 59, no. 4, pp. 349-363, 2004

Received 19 March 2004
|
Accepted 19 March 2004
|
Published: 2004
Price: EUR 27.50
Show more