Results 1 
3 of
3
Algorithmics on SLPcompressed strings: a survey,
 Groups Complex. Cryptol.
, 2012
"... Abstract Results on algorithmic problems on strings that are given in a compressed form via straightline programs are surveyed. A straightline program is a contextfree grammar that generates exactly one string. In this way, exponential compression rates can be achieved. Among others, we study pat ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
(Show Context)
Abstract Results on algorithmic problems on strings that are given in a compressed form via straightline programs are surveyed. A straightline program is a contextfree grammar that generates exactly one string. In this way, exponential compression rates can be achieved. Among others, we study pattern matching for compressed strings, membership problems for compressed strings in various kinds of formal languages, and the problem of querying compressed strings. Applications in combinatorial group theory and computational topology and to the solution of word equations are discussed as well. Finally, extensions to compressed trees and pictures are considered.
Equivalence of deterministic nested word to word transducers
 In FCT, volume 5699 of LNCS
, 2009
"... Abstract. We study the equivalence problem of deterministic nested word to word transducers and show it to be surprisingly robust. Modulo polynomial time reductions, it can be identified with 4 equivalence problems for diverse classes of deterministic noncopying orderpreserving transducers. In par ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We study the equivalence problem of deterministic nested word to word transducers and show it to be surprisingly robust. Modulo polynomial time reductions, it can be identified with 4 equivalence problems for diverse classes of deterministic noncopying orderpreserving transducers. In particular, we present polynomial time back and fourth reductions to the morphism equivalence problem on context free languages, which is known to be solvable in polynomial time. Keywords: trees, transducers, automata, contextfree grammars, XML. 1
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
 in "Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures
"... Abstract. We study generalized fixedpoint equations over idempotent semirings and provide an efficient algorithm for the detection whether a sequence of Kleene’s iterations stabilizes after a finite number of steps. Previously known approaches considered only bounded semirings where there are no in ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We study generalized fixedpoint equations over idempotent semirings and provide an efficient algorithm for the detection whether a sequence of Kleene’s iterations stabilizes after a finite number of steps. Previously known approaches considered only bounded semirings where there are no infinite descending chains. The main novelty of our work is that we deal with semirings without the boundedness restriction. Our study is motivated by several applications from interprocedural dataflow analysis. We demonstrate how the reachability problem for weighted pushdown automata can be reduced to solving equations in the framework mentioned above and we describe a few applications to demonstrate its usability. 1