A formal language perspective on factorized representations
From MaRDI portal
Cites work
- #NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes
- A dichotomy for succinct representations of homomorphisms
- A Researcher's Digest of GQL (invited talk)
- Algorithmics on SLP-compressed strings: a survey
- Analytic combinatorics
- Balancing Straight-line Programs
- Boundedness of conjunctive regular path queries
- Conjunctive queries with free access patterns under updates
- Efficient enumeration of words in regular languages
- Evaluation and enumeration problems for regular path queries
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 1528666 (Why is no real title available?)
- scientific article; zbMATH DE number 7204563 (Why is no real title available?)
- scientific article; zbMATH DE number 7650892 (Why is no real title available?)
- Lower bounds for context-free grammars
- LR-parsing of extended context free grammars
- On certain formal properties of grammars
- On path equivalence of nondeterministic finite automata
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- Size bounds for factorised representations of query results
- Streaming enumeration on nested documents
- The Smallest Grammar Problem
- Three New Algorithms for Regular Language Enumeration
- When is approximate counting for conjunctive queries tractable?
This page was built for publication: A formal language perspective on factorized representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7292788)
