String execution time for finite languages: max is easy, min is hard (Q642653): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance evaluation of (max,+) automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5200628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supervisory control of \((\max,+)\) automata: a behavioral approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supervisory Control of a Class of Discrete Event Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3754627 / rank
 
Normal rank

Latest revision as of 14:46, 4 July 2024

scientific article
Language Label Description Also known as
English
String execution time for finite languages: max is easy, min is hard
scientific article

    Statements

    String execution time for finite languages: max is easy, min is hard (English)
    0 references
    0 references
    0 references
    0 references
    27 October 2011
    0 references
    languages
    0 references
    finite-state automata
    0 references
    (max
    0 references
    +) semiring
    0 references
    heap models
    0 references
    computational complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references