Operational State Complexity of Subtree-Free Regular Tree Languages (Q5298309): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: State complexity of power / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of combined operations for suffix-free regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of state complexity of combined operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of star of union and square of union on \textit{k} regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of union and intersection of square and reversal on \(k\) regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of basic operations on suffix-free regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of the concatenation of regular tree languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: The state complexity of \(L^{2}\) and \(L^k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of combined operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: The state complexities of some basic operations on regular languages / rank
 
Normal rank

Revision as of 03:54, 13 July 2024

scientific article; zbMATH DE number 6663534
Language Label Description Also known as
English
Operational State Complexity of Subtree-Free Regular Tree Languages
scientific article; zbMATH DE number 6663534

    Statements

    Operational State Complexity of Subtree-Free Regular Tree Languages (English)
    0 references
    0 references
    0 references
    0 references
    14 December 2016
    0 references
    deterministic ranked tree automata
    0 references
    state complexity
    0 references
    subtree-free regular tree languages
    0 references

    Identifiers