Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Dendric word"'
Publikováno v:
International Journal of Foundations of Computer Science
International Journal of Foundations of Computer Science, World Scientific Publishing, 2018, 29 (05), pp.705-720. ⟨10.1142/S0129054118420017⟩
International Journal of Foundations of Computer Science, World Scientific Publishing, 2018, 29 (05), pp.705-720. ⟨10.1142/S0129054118420017⟩
International audience; Received (Day Month Year) Accepted (Day Month Year) Communicated by (xxxxxxxxxx) Dendric words are infinite words that are defined in terms of extension graphs. These are bipartite graphs that describe the left and right exten
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e881ea6a47866cc15f3d8fa4a9e7ba1
https://doi.org/10.1142/s0129054118420017
https://doi.org/10.1142/s0129054118420017
Publikováno v:
International Journal of Foundations of Computer Science
International Journal of Foundations of Computer Science, World Scientific Publishing, 2018, 29 (05), pp.705-720. ⟨10.1142/S0129054118420017⟩
International Journal of Foundations of Computer Science, World Scientific Publishing, 2018, 29 (05), pp.705-720. ⟨10.1142/S0129054118420017⟩
International audience; Dendric words are infinite words that are defined in terms of extension graphs. These are bipartite graphs that describe the left and right extensions of factors. Dendric words are such that all their extension graphs are tree
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::cb2f0ea3a1691e83d257521b8a4537de
https://hal.archives-ouvertes.fr/hal-02455370/document
https://hal.archives-ouvertes.fr/hal-02455370/document
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.
K zobrazení výsledku je třeba se přihlásit.