A PTIME-complete matching problem for SLP-compressed words

Authors:
N. Markey;Ph. Schnoebelen
Affiliations:
Département d'Informatique, Université Libre de Bruxelles, 1050 Brussels, Belgium;Laboratoire Spécification et Vérification, ENS de Cachan, CNRS UMR 8643, France
Venue:
Information Processing Letters
Year:
2004

Citing 11
Cited 5

A catalog of complexity classes

Handbook of theoretical computer science (vol. A)
P-complete problems in data compression

Theoretical Computer Science
Limits to parallel computation: P-completeness theory

Limits to parallel computation: P-completeness theory
Finite Monoids: From Word to Circuit Evaluation

SIAM Journal on Computing
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

Journal of the ACM (JACM)
On the Tape Complexity of Deterministic Context-Free Languages

Journal of the ACM (JACM)
Data compression via textual substitution

Journal of the ACM (JACM)
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract)

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Complexity of Language Recognition Problems for Compressed Words

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Algorithms on Compressed Strings and Arrays

SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Almost Optimal Fully LZW-Compressed Pattern Matching

DCC '99 Proceedings of the Conference on Data Compression

The complexity of tree automata and XPath on grammar-compressed trees

Theoretical Computer Science - Implementation and application of automata
Leaf languages and string compression

Information and Computation
Window subsequence problems for compressed texts

CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Querying and embedding compressed texts

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Tree automata and XPath on compressed trees

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.89

Visualization

Abstract

SLP-compressed words are words given by simple deterministic grammars called "straight-line programs". We prove that the problem of deciding whether an SLP-compressed word is recognized by an FSA is complete for polynomial-time.