Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Gelle, Kitti"'
Autor:
Gelle, Kitti, Iván, Szabolcs
Publikováno v:
EPTCS 305, 2019, pp. 169-182
We show that if a context-free grammar generates a language whose lexicographic ordering is well-ordered of type less than $\omega^2$, then its order type is effectively computable.
Comment: In Proceedings GandALF 2019, arXiv:1909.05979. arXiv a
Comment: In Proceedings GandALF 2019, arXiv:1909.05979. arXiv a
Externí odkaz:
http://arxiv.org/abs/1909.08543
Autor:
Gelle, Kitti, Ivan, Szabolcs
A linear ordering is called context-free if it is the lexicographic ordering of some context-free language and is called scattered if it has no dense subordering. Each scattered ordering has an associated ordinal, called its rank. It is known that th
Externí odkaz:
http://arxiv.org/abs/1907.11573
Autor:
Gelle, Kitti, Ivan, Szabolcs
A prefix grammar is a context-free grammar whose nonterminals generate prefix-free languages. A prefix grammar $G$ is an ordinal grammar if the language $L(G)$ is well-ordered with respect to the lexicographic ordering. It is known that from a finite
Externí odkaz:
http://arxiv.org/abs/1811.03595
Autor:
Gelle, Kitti, Ivan, Szabolcs
In this paper we study the problem of fully dynamic maximal matching with lookahead. In a fully dynamic $n$-vertex graph setting, we have to handle updates (insertions and removals of edges), and answer queries regarding the current graph, preferably
Externí odkaz:
http://arxiv.org/abs/1807.05009
Autor:
Gelle, Kitti, Iván, Szabolcs
Publikováno v:
EPTCS 252, 2017, pp. 114-127
Reversible forms of computations are often interesting from an energy efficiency point of view. When the computation device in question is an automaton, it is known that the minimal reversible automaton recognizing a given language is not necessarily
Externí odkaz:
http://arxiv.org/abs/1705.10533
Autor:
Gelle, Kitti, Ivan, Szabolcs
Disjoint-Set forests, consisting of Union-Find trees, are data structures having a widespread practical application due to their efficiency. Despite them being well-known, no exact structural characterization of these trees is known (such a character
Externí odkaz:
http://arxiv.org/abs/1704.07254
Autor:
Gelle, Kitti, Ivan, Szabolcs
Disjoint-Set forests, consisting of Union-Find trees are data structures having a widespread practical application due to their efficiency. Despite them being well-known, no exact structural characterization of these trees is known (such a characteri
Externí odkaz:
http://arxiv.org/abs/1510.07462
Autor:
Gelle, Kitti, Ivan, Szabolcs
In this paper we define future-time branching temporal logics evaluated over forests, that is, ordered tuples of ordered, but unranked, finite trees. We associate a rich class FL[$\mathcal{L}$] of temporal logics to each set L of (regular) modalities
Externí odkaz:
http://arxiv.org/abs/1506.03843
Autor:
Gelle, Kitti, Iván, Szabolcs
Publikováno v:
In Theoretical Computer Science 12 November 2019 793:1-13
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.