Generating, sampling and counting subclasses of regular tree languages (Q359886): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ToXgene / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964169047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal form algorithms for extended context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration and generation with a string automata representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration and random generation of accessible automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the number of strings of given length in context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tractability Frontier for NFA Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-unambiguous regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus for the random generation of labelled combinatorial structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplifying XML schema: single-type approximations of regular tree languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinctness of pattern-based schema languages for XML / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quasi-polynomial-time algorithm for sampling words from a context-free language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Generation of Deterministic Tree (Walking) Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Decision Problems for XML Schemas and Chain Regular Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimization of XML schemas and tree automata for unranked trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Equivalence of Finite Tree Automata / rank
 
Normal rank

Latest revision as of 19:39, 6 July 2024

scientific article
Language Label Description Also known as
English
Generating, sampling and counting subclasses of regular tree languages
scientific article

    Statements

    Generating, sampling and counting subclasses of regular tree languages (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 August 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    XML schema languages
    0 references
    counting
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references