Inclusion Test Algorithms for One-Unambiguous Regular Expressions (Q5505596): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Partial derivatives of regular expressions and finite automaton constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting regular inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: CDuce / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular expressions into finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-unambiguous regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivatives of Regular Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE ABSTRACT THEORY OF AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5536277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank

Latest revision as of 00:52, 29 June 2024

scientific article; zbMATH DE number 5498383
Language Label Description Also known as
English
Inclusion Test Algorithms for One-Unambiguous Regular Expressions
scientific article; zbMATH DE number 5498383

    Statements

    Inclusion Test Algorithms for One-Unambiguous Regular Expressions (English)
    0 references
    0 references
    0 references
    27 January 2009
    0 references
    0 references
    one-unambiguous regular expression
    0 references
    inclusion
    0 references
    algorithm
    0 references
    0 references
    0 references
    0 references