978-3-642-20711-2
978-3-642-20712-9
Computer Science – Theory and Applications
true
https://scigraph.springernature.com/explorer/license/
size
membership
2011-01-01
chapters
Rytter
unary alphabet
upper
state automata
algorithm
grammar
time
labels
2022-08-04T17:18
algorithmic problems
chapter
problem
transition labels
questions
Compressed Membership in Automata with Compressed Labels
assumption
string
NP upper
context-free grammars
2011
period
NP algorithm
alphabet
polynomial time
275-288
Plandowski
compression
automata
string compression
input size
https://doi.org/10.1007/978-3-642-20712-9_21
program
The algorithmic problem of whether a compressed string is accepted by a (nondeterministic) finite state automaton with compressed transition labels is investigated. For string compression, straight-line programs (SLPs), i.e., context-free grammars that generate exactly one string, are used. Two algorithms for this problem are presented. The first one works in polynomial time, if all transition labels are nonperiodic strings (or more generally, the word length divided by the period is bounded polynomially in the input size). This answers a question of Plandowski and Rytter. The second (nondeterministic) algorithm is an NP-algorithm under the assumption that for each transition label the period is bounded polynomially in the input size. This generalizes the NP upper bound for the case of a unary alphabet, shown by Plandowski and Rytter.
second algorithm
straight-line programs
finite state automata
cases
Lohrey
Markus
Institut für Informatik, Universität Leipzig, Germany
Institut für Informatik, Universität Leipzig, Germany
Computation Theory and Mathematics
Vereshchagin
Nikolay
Springer Nature - SN SciGraph project
doi
10.1007/978-3-642-20712-9_21
pub.1012277274
dimensions_id
Mathissen
Christian
Information and Computing Sciences
Kulikov
Alexander
Springer Nature