Automata, Languages and Programming
From MaRDI portal
Publication:5466495
DOI10.1007/b99859zbMath1099.68028OpenAlexW2505584480MaRDI QIDQ5466495
Publication date: 24 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99859
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorics on words (68R15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42)
Related Items (15)
The complexity of tree automata and XPath on grammar-compressed trees ⋮ Linear pattern matching of compressed terms and polynomial rewriting ⋮ Parameter reduction and automata evaluation for grammar-compressed trees ⋮ Two fast constructions of compact representations of binary words with given set of periods ⋮ Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts ⋮ Isomorphism of Regular Trees and Words ⋮ Functional programs as compressed data ⋮ Colored operads, series on colored operads, and combinatorial generating systems ⋮ Compaction of Church numerals ⋮ Compressed string-matching in standard Sturmian words ⋮ Computing Longest Common Substring and All Palindromes from Compressed Strings ⋮ Parameter Reduction in Grammar-Compressed Trees ⋮ Syntactic view of sigma-tau generation of permutations ⋮ Efficient algorithms to compute compressed longest common substrings and compressed palindromes ⋮ Tree compression with top trees
This page was built for publication: Automata, Languages and Programming
