Search Results - "Jeż, Artur"

Word equations in non-deterministic linear space by Jeż, Artur

“…Satisfiability of word equations problem is: Given two sequences consisting of letters and variables decide whether there is a substitution for the variables…”
Get full text

A really simple approximation of smallest grammar by Je, Artur

“…In this paper we present a really simple linear-time algorithm constructing a context-free grammar of size 4glog3/2⁡(N/g) for the input string, where N is the…”
Get full text

Approximation of grammar-based compression via recompression by Je, Artur

“…In this paper we present a simple linear-time algorithm constructing a context-free grammar of size O(glog⁡(N/g)) for the input string, where N is the size of…”
Get full text

One-Variable Word Equations in Linear Time by Jeż, Artur

“…In this paper we consider word equations with one-variable (and arbitrarily many occurrences of it). A recent technique of recompression, which is applicable…”
Get full text

Finding all solutions of equations in free groups and monoids with involution by Diekert, Volker, Jeż, Artur, Plandowski, Wojciech

“…This paper presents a PSPACE algorithm which yields a finite graph of exponential size that describes the set of all solutions of equations in free groups as…”
Get full text

Approximation of smallest linear tree grammar by Jeż, Artur, Lohrey, Markus

“…A simple linear-time algorithm for constructing a linear context-free tree grammar of size O(rg+rglog⁡(n/rg)) for a given input tree T of size n is presented,…”
Get full text

Unambiguous conjunctive grammars over a one-symbol alphabet by Jeż, Artur, Okhotin, Alexander

“…It is demonstrated that unambiguous conjunctive grammars over a unary alphabet Σ={a} have non-trivial expressive power, and that their basic properties are…”
Get full text

Constructing small tree grammars and small circuits for formulas by Ganardi, Moses, Hucke, Danny, Jeż, Artur, Lohrey, Markus, Noeth, Eric

“…It is shown that every tree of size n over a fixed set of σ different ranked symbols can be produced by a so called straight-line linear context-free tree…”
Get full text

The Complexity of Compressed Membership Problems for Finite Automata by Je, Artur

“…In this paper, a compressed membership problem for finite automata, both deterministic (DFAs) and non-deterministic (NFAs), with compressed transition labels…”
Get full text

Computational completeness of equations over sets of natural numbers by Jeż, Artur, Okhotin, Alexander

“…Systems of finitely many equations of the form φ(X1,…,Xn)=ψ(X1,…,Xn) are considered, in which the unknowns Xi are sets of natural numbers, while the…”
Get full text

Least and greatest solutions of equations over sets of integers by Jeż, Artur, Okhotin, Alexander

“…Systems of equations with sets of integers as unknowns are considered, with the operations of union, intersection and addition of sets, S+T={m+n|m∈S,n∈T}…”
Get full text

Equations over sets of integers with addition only by Jeż, Artur, Okhotin, Alexander

“…Systems of equations of the form X=Y+Z and X=C are considered, in which the unknowns are sets of integers, the plus operator denotes element-wise sum of sets,…”
Get full text

Validating the Knuth-Morris-Pratt Failure Function, Fast and Online by Gawrychowski, Paweł, Jeż, Artur, Jeż, Łukasz

“…Let denote the failure function of the Knuth-Morris-Pratt algorithm for a word w . In this paper we study the following problem: given an integer array , is…”
Get full text

Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth by Jeż, Artur, Okhotin, Alexander

“…It has recently been proved (Jeż, DLT 2007) that conjunctive grammars (that is, context-free grammars augmented by conjunction) generate some non-regular…”
Get full text

On the two-dimensional cow search problem by JEZ, Artur, LOPUSZANSKI, Jakub

“…We investigate the problem introduced by Baeza-Yates et al. [R.A. Baeza-Yates, J.C. Culberson, G.J.E. Rawlins, Searching with uncertainty, Research report,…”
Get full text

Complexity of Equations over Sets of Natural Numbers by Jeż, Artur, Okhotin, Alexander

“…Systems of equations of the form X i = φ i ( X 1 ,…, X n ) (1 ≤ i ≤ n ) are considered, in which the unknowns are sets of natural numbers. Expressions φ i may…”
Get full text

One-Nonterminal Conjunctive Grammars over a Unary Alphabet by Jeż, Artur, Okhotin, Alexander

“…Conjunctive grammars over an alphabet Σ ={ a } are studied, with the focus on the special case with a unique nonterminal symbol. Such a grammar is equivalent…”
Get full text

Representing Hyper-arithmetical Sets by Equations over Sets of Integers by Jeż, Artur, Okhotin, Alexander

“…Systems of equations with sets of integers as unknowns are considered. It is shown that the class of sets representable by unique solutions of equations using…”
Get full text

Collecting Weighted Items from a Dynamic Queue by Bienkowski, Marcin, Chrobak, Marek, Dürr, Christoph, Hurand, Mathilde, Jeż, Artur, Jeż, Łukasz, Stachowiak, Grzegorz

“…We consider online competitive algorithms for the problem of collecting weighted items from a dynamic queue S . The content of S varies over time. An update to…”
Get full text

A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue by Bienkowski, Marcin, Chrobak, Marek, Dürr, Christoph, Hurand, Mathilde, Jeż, Artur, Jeż, Łukasz, Stachowiak, Grzegorz

“…The bounded-delay packet scheduling (or buffer management) problem is to schedule transmissions of packets arriving in a buffer of a network link. Each packet…”
Get full text