Autor:	Antonina Nepeivoda
Rok vydání:	2018
Předmět:	For loop Discrete mathematics Combinatorics Loop (topology) Relation (database) Binary relation Subsequence Longest increasing subsequence Mathematics
Zdroj:	Ershov Memorial Conference (Posters)
ISSN:	2398-7340
Popis:	The paper studies the subsequence relation through a notion of an intransitive binary relation on words in traces generated by prefix-rewriting systems. The relation was introduced in 1988 by V.F. Turchin for loop approximation in supercompilation. We study properties of this relation and introduce some refinements of the subsequence relation that inherit the useful features of Turchin's relation.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::4e6058e243182bd0fd80dd5b7554ae34 https://doi.org/10.29007/xqx9 Zobrazit plný text záznamu