Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Igor Litovsky"'
Autor:
Igor Litovsky, Vinh Duc Tran
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 55:2
We investigate the open problem to characterize whether the infinite power of a given language is generated by an ω-code. In case the given language is a code (i.e. zero-relation language), the problem was solved. In this work, we solve the problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b4c15794a62ff74467445617aaad237c
https://doi.org/10.1051/ita/2021002
https://doi.org/10.1051/ita/2021002
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 30:181-194
In [6] a definition of zigzag stability for zigzag submonoids is given. We give here a new definition of zigzag stability, which is simpler and very close to the usual definition of stability for ordinary submonoids. We give a short proof that zigzag
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::522bf8eeea05676a57dfc9df7d76e591
https://doi.org/10.1051/ita/1996300301811
https://doi.org/10.1051/ita/1996300301811
Publikováno v:
Electronic Notes in Theoretical Computer Science. 2:199-206
This paper is a contribution to the study of the general problem of characterizing those properties which can be computed on a graph or a network by means of local transformations. By using an abstract model based on graph relabelling systems we cons
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::30c2850410dbb17c8c442db596b28282
https://doi.org/10.1016/s1571-0661(05)80197-5
https://doi.org/10.1016/s1571-0661(05)80197-5
Autor:
Yves Métivier, Igor Litovsky
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 1993, 115, pp.191-224
Theoretical Computer Science, Elsevier, 1993, 115, pp.191-224
In this paper, the computational power of the noetherian graph rewriting systems with priorities (PGRSs) is studied. We define the notion of safe PGRS with respect to a given property. The PGRSs are considered as recognizers for sets of graphs (1-gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::89b8bc3c39f15dd98614549a50674740
Autor:
Igor Litovsky, B. Le Saëc
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 26:45-58
Les ω-languages R ω tels que (1) Pref (R ω ) R ω =R ω , (2) Suf (R ω )=R ω on (3) Pref (R ω ) Suf (R ω )=R ω sont caracterises au moyen de proprietes du language Stab (R ω )={u∈Σ*:uR ω ⊂R ω } et au moyen de proprietes des ω-generat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a24f2cd6d39ed9c311914889dd5cebf7
https://doi.org/10.1051/ita/1992260100451
https://doi.org/10.1051/ita/1992260100451
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 26:565-580
Les zigzag codes sont etudies par le biais des morphismes de monoides et de groupes libres. L'injectivite des morphismes de groupes libres joue ici le role de celle des morphismes de monoides pour les codes. Les calculs decrits dans le groupe libre a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ac604df84d8afbcf9450edf0a396750
https://doi.org/10.1051/ita/1992260605651
https://doi.org/10.1051/ita/1992260605651
Autor:
Igor Litovsky
Publikováno v:
Information Processing Letters. 37:61-65
We give an algorithm to decide whether a given regular ω-language is equal to Pω for some prefix-free language P. We emphasize the differences between the case of finite prefix-free ω-generators and the case of infinite prefix-free ω-generators.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::253262b31e3efc8c8ce79e52408a243c
https://doi.org/10.1016/0020-0190(91)90134-4
https://doi.org/10.1016/0020-0190(91)90134-4
Autor:
Xavier Augros, Igor Litovsky
Publikováno v:
The Mathematical Foundation of Informatics.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::182a65feedf6399d200aa705d7d3296f
https://doi.org/10.1142/9789812703118_0003
https://doi.org/10.1142/9789812703118_0003
Autor:
Long Van Do, Igor Litovsky
Publikováno v:
Developments in Language Theory ISBN: 9783540404316
Developments in Language Theory
Developments in Language Theory
A special kind of codes with bounded deciphering delay, called k-comma-free codes, is considered. The advantage in using these codes is that the decoding can begin "anywhere" in a coded message. This means that a coded message can be deciphered even
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::70bcfe8a55d6ffb066d6a12d1d0796de
https://doi.org/10.1007/3-540-45005-x_33
https://doi.org/10.1007/3-540-45005-x_33
Publikováno v:
Handbook of graph grammars and computing by graph transformation
World Scientific. Handbook of graph grammars and computing by graph transformation, H.~ and H.-J.~ and U.~ and G.~, pp.1-56, 1999
World Scientific. Handbook of graph grammars and computing by graph transformation, H.~ and H.-J.~ and U.~ and G.~, pp.1-56, 1999
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::95a55d414e0cac7c4c5bf07e26d331d6
https://hal.archives-ouvertes.fr/hal-00307042
https://hal.archives-ouvertes.fr/hal-00307042