Výsledky vyhledávání

Publikováno v: Information Processing Letters. 60:1-5

Up to now, the question “given a rational language R, how to decide if there exists an ω-code C such that Cω = Rω?” remains with no general solution. We give an answer assuming that the greatest ω-generator of Rω exists and is a free submono

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::2dd0ef942a805c78544fb310deadd9d9
https://doi.org/10.1016/s0020-0190(96)00136-6

Zobrazit plný text záznamu

Finitely generated biω-languages

Autor: J. Devolder, I. Litovsky

Publikováno v: Theoretical Computer Science. 85:33-52

In this paper we are interested in the bi-infinite words and mainly in the bi-infinite power of languages of finite words. With the aim of deciding whether, given a rational language R , ω R ω is finitely generated, i.e. whether ω R ω = ω R ω f

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d777ce0069d961a7ab41639a735cbda
https://doi.org/10.1016/0304-3975(91)90046-5

Zobrazit plný text záznamu

Minimal generators of submonoids of $A^\infty $

Autor: I. Litovsky

Publikováno v: RAIRO - Theoretical Informatics and Applications. 25:3-17

Dans le monoide A ∞ certains sous-monoides n'ont pas de generateurs minimaux par rapport a l'inclusion; nous caracterisons ici ces sous-monoides. Puis dans le cas rationnel nous proposons des algorithmes pour decider si un sous-monoides. Puis dans

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::fd2f56c1c00235a2fc76e583c9c08c62
https://doi.org/10.1051/ita/1991250100031

Zobrazit plný text záznamu

On the recognition of families of graphs with local computations

Autor: Yves Métivier, W. Zielonka, I. Litovsky

Publikováno v: Information and Computation
Information and Computation, Elsevier, 1995, 118, pp.110-119

This paper is a contribution to understanding the power and the limitations of local computations in graphs. We use local computations to define a notion of graph recognition; our model allows a simulation of automata on words and on trees. We introd

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::636fa01426a4035c92d8459cc43c67a8
https://hal.archives-ouvertes.fr/hal-00307044

Zobrazit plný text záznamu

Computing with graph relabelling systems with priorities

Autor: Yves Métivier, I. Litovsky

Publikováno v: Lecture Notes in Computer Science ISBN: 9783540544784
Graph-Grammars and Their Application to Computer Science
Graph grammars and their applications to computer science
International workshop on graph grammars and their applications to computer science
International workshop on graph grammars and their applications to computer science, 1991, Germany. pp.549-563

In this paper, the computational power of the noetherian Graph Relabelling systems with Priorities (PGRS for short) is studied. The PGRS's are considered as recognizers for sets of graphs and for sets of 1-sourced graphs. We show that the PGRS's are

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b5dd201cf383ee88f1a28275c5a15950
https://doi.org/10.1007/bfb0017412

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

On generators of rational ω-power languages

Autor: I. Litovsky, E. Timmerman

Publikováno v: Theoretical Computer Science. (2-3):187-200

Un language `?-parfait? est un ?-langage L de la forme L=R? ou R est un langage de mots finis, appele generateur de L. Etant donne un langage rationel R, nous etudions la relation d'inclusion dans la famille des generateurs de R?: 1.(1) Nous montrons

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a072677692e2a222b4bfdc2132044a0d

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání