Usefulness of information and decomposability of unary regular languages (Q6186306): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2022.104868 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2022.104868 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4210507006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Usefulness of Information: Framework and NFA Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Usefulness of information and unary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplifying DPDA Using Supplementary Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling time criticality of information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5089219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prime languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2022.104868 / rank
 
Normal rank

Latest revision as of 20:16, 30 December 2024

scientific article; zbMATH DE number 7798804
Language Label Description Also known as
English
Usefulness of information and decomposability of unary regular languages
scientific article; zbMATH DE number 7798804

    Statements

    Usefulness of information and decomposability of unary regular languages (English)
    0 references
    0 references
    0 references
    0 references
    2 February 2024
    0 references
    decomposability
    0 references
    unary language
    0 references
    usefulness of information
    0 references
    descriptional complexity
    0 references
    state complexity
    0 references
    decidability
    0 references

    Identifiers