Generating words in a context-free language uniformly at random
Information Processing Letters
Random generation of words in an algebraic language in linear binary space
Information Processing Letters
Languages, automata, and logic
Handbook of formal languages, vol. 3
The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
Computational Chemical Graph Theory: Characterization, Enumeration and Generation of Chemical Structures by Computer Methods
Query efficient implementation of graphs of bounded clique-width
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
First-order queries on structures of bounded degree are computable with constant delay
ACM Transactions on Computational Logic (TOCL)
Tree acceptors and some of their applications
Journal of Computer and System Sciences
Finding branch-decompositions and rank-decompositions
ESA'07 Proceedings of the 15th annual European conference on Algorithms
N-ary queries by tree automata
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
MSO queries on tree decomposable structures are computable with linear delay
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Approximating rank-width and clique-width quickly
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Compact representation for answer sets of n-ary regular queries
Theoretical Computer Science
Database theory: query languages
Algorithms and theory of computation handbook
Efficient enumeration for conjunctive queries over x-underbar structures
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Counting and enumeration problems with bounded treewidth
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Monadic second-order model-checking on decomposable matroids
Discrete Applied Mathematics
Enumeration of minimal dominating sets and variants
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
On acyclic conjunctive queries and constant delay enumeration
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Enumerating with constant delay the answers to a query
Proceedings of the 16th International Conference on Database Theory
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Enumeration of monadic second-order queries on trees
ACM Transactions on Computational Logic (TOCL)
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation
Theory of Computing Systems
| Hi-index | 0.05 |
The results of a query expressed by a monadic second-order formula on a tree, on a graph or on a relational structure of tree-width at most k, can be enumerated with a delay between two outputs proportional to the size of the next output. This is possible by using a preprocessing that takes time O(n@?log(n)), where n is the number of vertices or elements. One can also output directly the i-th element with respect to a fixed ordering, however, in more than linear time in its size. These results extend to graphs of bounded clique-width. We also consider the enumeration of finite parts of recognizable sets of terms specified by parameters such as size, height or Strahler number.