Pages that link to "Item:Q5466495"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5466495):
Displaying 19 items.
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- Two fast constructions of compact representations of binary words with given set of periods (Q507396) (← links)
- Functional programs as compressed data (Q526441) (← links)
- Leaf languages and string compression (Q550251) (← links)
- The complexity of tree automata and XPath on grammar-compressed trees (Q860863) (← links)
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes (Q1006070) (← links)
- Colored operads, series on colored operads, and combinatorial generating systems (Q1999730) (← links)
- Compaction of Church numerals (Q2005559) (← links)
- Compressed string-matching in standard Sturmian words (Q2271418) (← links)
- Tree compression with top trees (Q2347804) (← links)
- Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts (Q3011864) (← links)
- Isomorphism of Regular Trees and Words (Q3012921) (← links)
- Parameter Reduction in Grammar-Compressed Trees (Q3617731) (← links)
- Linear pattern matching of compressed terms and polynomial rewriting (Q4585011) (← links)
- Lyndon factorization of grammar compressed texts revisited (Q5140789) (← links)
- Computer Science Logic (Q5292652) (← links)
- Computing Longest Common Substring and All Palindromes from Compressed Strings (Q5448662) (← links)
- Syntactic view of sigma-tau generation of permutations (Q5918363) (← links)
- Extended formulations via decision diagrams (Q6591617) (← links)
