Observations on the complexity of regular expression problems (Q1149249): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/0022-0000(79)90002-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966072464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5725992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4048566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence and containment problems for context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Time Versus Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Parallels between the Regular and Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular expressions and the equivalence of programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On formalised computer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank

Latest revision as of 10:29, 13 June 2024

scientific article
Language Label Description Also known as
English
Observations on the complexity of regular expression problems
scientific article

    Statements

    Observations on the complexity of regular expression problems (English)
    0 references
    1979
    0 references
    time complexity
    0 references
    equivalence problem
    0 references
    containment problem
    0 references
    program schemes
    0 references
    regular languages
    0 references
    regular grammars
    0 references
    LL(k) grammars
    0 references
    0 references

    Identifiers