Zobrazeno 1 - 10
of 1 943
pro vyhledávání: '"Nested word"'
Publikováno v:
Logical Methods in Computer Science, Volume 15, Issue 2 (April 4, 2019) lmcs:3763
We consider the problem of evaluating in streaming (i.e., in a single left-to-right pass) a nested word transduction with a limited amount of memory. A transduction T is said to be height bounded memory (HBM) if it can be evaluated with a memory that
Externí odkaz:
http://arxiv.org/abs/1707.00527
Autor:
Henry, Christopher S.
In this article we provide a new perspective on the word problem of a group by using languages of nested words. These were introduced by Alur and Madhusudan as a way to model programming languages such as HTML. We demonstrate how a class of nested wo
Externí odkaz:
http://arxiv.org/abs/1310.6283
Publikováno v:
In Theoretical Computer Science 3 May 2015 578:100-125
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 2 (2019)
We consider the problem of evaluating in streaming (i.e., in a single left-to-right pass) a nested word transduction with a limited amount of memory. A transduction T is said to be height bounded memory (HBM) if it can be evaluated with a memory that
Externí odkaz:
https://doaj.org/article/cb9a45171c924ea4981837832a8e555a
Autor:
Salomaa, Kai
Publikováno v:
In Information and Computation March 2011 209(3):580-589
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.
Autor:
Piao, Xiaoxue, Salomaa, Kai
Publikováno v:
In Theoretical Computer Science 2009 410(35):3290-3302
Publikováno v:
CSR 2020-15th International Computer Science Symposium in Russia
CSR 2020-15th International Computer Science Symposium in Russia, Jun 2020, Ekaterinburg, Russia
Computer Science – Theory and Applications ISBN: 9783030500252
CSR
15th International Computer Science Symposium in Russia
15th International Computer Science Symposium in Russia, Jul 2020, Ekaterinburg, Russia
CSR 2020-15th International Computer Science Symposium in Russia, Jun 2020, Ekaterinburg, Russia
Computer Science – Theory and Applications ISBN: 9783030500252
CSR
15th International Computer Science Symposium in Russia
15th International Computer Science Symposium in Russia, Jul 2020, Ekaterinburg, Russia
International audience; We study the problem of whether regular expressions for nested words can be compiled to small deterministic nested word au-tomata (NWAs). In theory, we obtain a positive answer for small deter-ministic regular expressions for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::666863aed71b61694903be57ad7ee7a1
https://hal.inria.fr/hal-02532706
https://hal.inria.fr/hal-02532706
Autor:
Han, Yo-Sub, Salomaa, Kai
Publikováno v:
In Theoretical Computer Science 2009 410(30):2961-2971
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.