Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages (Q6169889): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Minimal Union-Free Decompositions of Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most complex deterministic union-free regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equations for union-free regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and Complexity of Some Subregular Language Families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLEXITY IN UNION-FREE REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Union-Free and Deterministic Union-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressive capacity of subregular expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isometries on positive operators of unit norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Union-freeness, deterministic union-freeness and union-complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operational union-complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank

Latest revision as of 14:21, 2 August 2024

scientific article; zbMATH DE number 7726946
Language Label Description Also known as
English
Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages
scientific article; zbMATH DE number 7726946

    Statements

    Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages (English)
    0 references
    0 references
    15 August 2023
    0 references
    union-free languages
    0 references
    1CFP automata
    0 references
    subregular languages
    0 references
    union-decomposition
    0 references
    union-complexity
    0 references
    closure properties
    0 references

    Identifiers