Aspects of shuffle and deletion on trajectories
Result description
Word and language operations on trajectories provide a general framework for the study of properties of sequential insertion and deletion operations. A trajectory gives a syntactical constraint on the scattered insertion (deletion) of a word into(from) another one, with an intuitive geometrical interpretation. Moreover, deletion on trajectories is an inverse of the shuffle on trajectories. These operations are a natural generalization of many binary word operations like catenation, quotient, insertion,deletion, shuffle, etc. Besides they were shown to be useful, e.g. in concurrent processes modelling and recently in biocomputing area.
Keywords
The result's identifiers
Result code in IS VaVaI
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Aspects of shuffle and deletion on trajectories
Original language description
Word and language operations on trajectories provide a general framework for the study of properties of sequential insertion and deletion operations. A trajectory gives a syntactical constraint on the scattered insertion (deletion) of a word into(from) another one, with an intuitive geometrical interpretation. Moreover, deletion on trajectories is an inverse of the shuffle on trajectories. These operations are a natural generalization of many binary word operations like catenation, quotient, insertion,deletion, shuffle, etc. Besides they were shown to be useful, e.g. in concurrent processes modelling and recently in biocomputing area.
Czech name
Vlastnosti operací míchání a mazání na trajektoriích
Czech description
Operace na trajektoriích nad slovy a jazyky poskytují obecný rámec pro studium operací založených na sekvenčním vkládání a vymazávání. Trajektorie představují syntaktickou podmínku omezující tyto operace, s intuitivním geometrickým významem. Studujeme algebraické vlastnosti vymazávání na trajektoriích a s tím spojené rozhodovací vlastnosti. Mimo jiné charakterizujeme třídu operací, pro které je (ne)rozhodnutelná řešitelnost jednoduchých rovnic nad jazyky, jež tyto operace obsahují.
Classification
Type
Jx - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2005
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
THEORETICAL COMPUTER SCIENCE
ISSN
0304-3975
e-ISSN
—
Volume of the periodical
1
Issue of the periodical within the volume
332
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
14
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—
Basic information
Result type
Jx - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP
IN - Informatics
Year of implementation
2005