A characterization of Thompson digraphs. (Q1421476): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of LR(k) parsers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The validation of SGML content models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of Glushkov automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Techniques: Regular expression search algorithm / rank
 
Normal rank

Latest revision as of 14:18, 6 June 2024

scientific article
Language Label Description Also known as
English
A characterization of Thompson digraphs.
scientific article

    Statements

    A characterization of Thompson digraphs. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 January 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Regular expressions
    0 references
    Dyck strings
    0 references
    Thompson machine
    0 references