Zobrazeno 1 - 10
of 76
pro vyhledávání: '"Jez, Artur"'
Parikh's Theorem is a fundamental result in automata theory with numerous applications in computer science: software verification (e.g. infinite-state verification, string constraints, and theory of arrays), verification of cryptographic protocols (e
Externí odkaz:
http://arxiv.org/abs/2311.03901
Sequence theories are an extension of theories of strings with an infinite alphabet of letters, together with a corresponding alphabet theory (e.g. linear integer arithmetic). Sequences are natural abstractions of extendable arrays, which permit a we
Externí odkaz:
http://arxiv.org/abs/2308.00175
We give algorithms that, given a straight-line program (SLP) with $g$ rules that generates (only) a text $T [1..n]$, builds within $O(g)$ space the Lempel-Ziv (LZ) parse of $T$ (of $z$ phrases) in time $O(n\log^2 n)$ or in time $O(gz\log^2(n/z))$. We
Externí odkaz:
http://arxiv.org/abs/2212.02327
Autor:
Ferens, Robert, Jeż, Artur
A word equation with one variable in a free group is given as $U = V$, where both $U$ and $V$ are words over the alphabet of generators of the free group and $X, X^{-1}$, for a fixed variable $X$. An element of the free group is a solution when subst
Externí odkaz:
http://arxiv.org/abs/2101.06201
Autor:
Bannai, Hideo, Hirayama, Momoko, Hucke, Danny, Inenaga, Shunsuke, Jez, Artur, Lohrey, Markus, Reh, Carl Philipp
In a seminal paper of Charikar et al. on the smallest grammar problem, the authors derive upper and lower bounds on the approximation ratios for several grammar-based compressors, but in all cases there is a gap between the lower and upper bound. Her
Externí odkaz:
http://arxiv.org/abs/1908.06428
It is shown that a context-free grammar of size $m$ that produces a single string $w$ (such a grammar is also called a string straight-line program) can be transformed in linear time into a context-free grammar for $w$ of size $\mathcal{O}(m)$, whose
Externí odkaz:
http://arxiv.org/abs/1902.03568
In a seminal paper of Charikar et al.~on the smallest grammar problem, the authors derive upper and lower bounds on the approximation ratios for several grammar-based compressors. Here we improve the lower bound for the famous {\sf RePair} algorithm
Externí odkaz:
http://arxiv.org/abs/1703.06061
Autor:
Jeż, Artur
Satisfiability of word equations is an important problem in the intersection of formal languages and algebra: Given two sequences consisting of letters and variables we are to decide whether there is a substitution for the variables that turns this e
Externí odkaz:
http://arxiv.org/abs/1702.00736
Autor:
Jeż, Artur
Publikováno v:
In Journal of Computer and System Sciences February 2022 123:122-142
We give NSPACE(n log n) algorithms solving the following decision problems. Satisfiability: Is the given equation over a free partially commutative monoid with involution (resp. a free partially commutative group) solvable? Finiteness: Are there only
Externí odkaz:
http://arxiv.org/abs/1603.02966