Zobrazeno 1 - 10
of 6 314
pro vyhledávání: '"Finite tree"'
Publikováno v:
Fundamenta Informaticae, Volume 184, Issue 1 (December 23, 2021) fi:7402
We provide new insights on the determinization and minimization of tree automata using congruences on trees. From this perspective, we study a Brzozowski's style minimization algorithm for tree automata. First, we prove correct this method relying on
Externí odkaz:
http://arxiv.org/abs/2104.11453
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:
Neretin, Yury A.
Publikováno v:
Izvestiya: Mathematics, 2020, 84:6, 1161-1191
Consider a tree $\mathbb T$, all whose vertices have countable valence; its boundary is the Baire space $\mathbb{B} \simeq\mathbb{N}^{\mathbb N}$; continued fractions expansions identify the set of irrational numbers $\mathbb{R}\setminus \mathbb{Q}$
Externí odkaz:
http://arxiv.org/abs/1909.09854
Autor:
Popa, Alexandru, Tanasescu, Andrei
Data compression plays a crucial part in the cloud based systems of today. One the fundaments of compression is quasi-periodicity, for which there are several models. We build upon the most popular quasi-periodicity model for strings, i.e., covers, g
Externí odkaz:
http://arxiv.org/abs/1806.08232
We consider inverse dynamic and spectral problems for the one dimensional Dirac system on a finite tree. Our aim will be to recover the topology of a tree (lengths and connectivity of edges) as well as matrix potentials on each edge. As inverse data
Externí odkaz:
http://arxiv.org/abs/1712.09063
In application domains that store data in a tabular format, a common task is to fill the values of some cells using values stored in other cells. For instance, such data completion tasks arise in the context of missing value imputation in data scienc
Externí odkaz:
http://arxiv.org/abs/1707.01469
Determinisation and completion of finite tree automata are important operations with applications in program analysis and verification. However, the complexity of the classical procedures for determinisation and completion is high. They are not pract
Externí odkaz:
http://arxiv.org/abs/1511.03595
Autor:
Moghari, S.1 s.moghari@shahroodut.ac.ir, Zahedi, M. M.2 zahedi_mm@modares.ac.ir
Publikováno v:
Iranian Journal of Fuzzy Systems. Oct2019, Vol. 16 Issue 5, p155-167. 13p.
Autor:
Lengál, Ondřej
Numerous computer systems use dynamic control and data structures of unbounded size. These data structures have often the character of trees or they can be encoded as trees with some additional pointers. This is exploited by some currently intensivel
Externí odkaz:
http://arxiv.org/abs/1204.3240
Autor:
vagvolgyi, Sandor
We show that left-linear generalized semi-monadic TRSs effectively preserving recognizability of finite tree languages (are EPRF-TRSs). We show that reachability, joinability, and local confluence are decidable for EPRF-TRSs.
Externí odkaz:
http://arxiv.org/abs/1006.5516