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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q61677537 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(94)00056-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076413258 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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