Parameter reduction and automata evaluation for grammar-compressed trees-Reference-Cited by-同舟云学术

Parameter reduction and automata evaluation for grammar-compressed trees

Author:

Lohrey Markus,Maneth Sebastian,Schmidt-Schauß Manfred

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference44 articles.

1. Grammar compression, LZ-encodings, and string algorithms with implicit input;Rytter,2004

2. The smallest grammar problem;Charikar;IEEE Trans. Inform. Theory,2005

3. Choosing word occurrences for the smallest grammar problem;Carrascosa,2010

4. An efficient pattern-matching algorithm for strings with short descriptions;Karpinski;Nordic J. Comput.,1997

5. An improved pattern matching algorithm for strings in terms of straight-line programs;Miyazaki;J. Discrete Algorithms,2000

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Enumeration for MSO-Queries on Compressed Trees;Proceedings of the ACM on Management of Data;2024-05-10

4. Largest common prefix of a regular tree language;Journal of Computer and System Sciences;2021-02