An optimal lower bound for nonregular languages (Q1330656): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3856819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-tape, off-line Turing machine computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Results on Tape-Bounded Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5180413 / rank
 
Normal rank

Latest revision as of 16:00, 22 May 2024

scientific article
Language Label Description Also known as
English
An optimal lower bound for nonregular languages
scientific article

    Statements

    An optimal lower bound for nonregular languages (English)
    0 references
    0 references
    0 references
    0 references
    21 July 1994
    0 references
    computational complexity
    0 references
    formal languages
    0 references
    lower bound
    0 references
    Turing machine
    0 references

    Identifiers