Compressed Membership in Automata with Compressed Labels
From MaRDI portal
Publication:3007633
DOI10.1007/978-3-642-20712-9_21zbMath1319.68137OpenAlexW2275139177MaRDI QIDQ3007633
Christian Mathissen, Markus Lohrey
Publication date: 17 June 2011
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20712-9_21
Related Items
The complexity of compressed membership problems for finite automata ⋮ One-variable word equations in linear time
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial-time word problems.
- COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA
- Efficient Computation in Groups Via Compression
- Processing Compressed Texts: A Tractability Border
- COMPRESSED WORDS AND AUTOMORPHISMS IN FULLY RESIDUALLY FREE GROUPS
- A universal algorithm for sequential data compression
- Word Problems and Membership Problems on Compressed Words
- Querying and Embedding Compressed Texts
This page was built for publication: Compressed Membership in Automata with Compressed Labels