State Complexity of Kleene-Star Operations on Trees (Q2891328): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-27654-5_30 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2098375093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: STATE-SIZE HIERARCHY FOR FINITE-STATE COMPLEXITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computation Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of power / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5437181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transition Complexity of Incomplete DFAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: General varieties of tree languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds on the Descriptional Complexity of Regular Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptional and computational complexity of finite automata -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the State Complexity of Operations on Two-Way Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism Is Essential in Small 2FAs with Few Reversals / 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: Transformations Between Different Models of Unranked Bottom-Up Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: State Trade-Offs in Unranked Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of combined operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of the State Complexity of Composed Regular Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata for XML -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Second Course in Formal Languages and Automata Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The state complexities of some basic operations on regular languages / rank
 
Normal rank

Latest revision as of 08:02, 5 July 2024

scientific article
Language Label Description Also known as
English
State Complexity of Kleene-Star Operations on Trees
scientific article

    Statements

    State Complexity of Kleene-Star Operations on Trees (English)
    0 references
    0 references
    0 references
    15 June 2012
    0 references
    tree automata
    0 references
    state complexity
    0 references
    iterated concatenation
    0 references

    Identifiers