Detecting patterns in finite regular and context-free languages (Q990125): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Detecting palindromes, patterns and borders in regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding patterns common to a set of strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a homomorphism between two words is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2726. A problem on strings of beads / rank
 
Normal rank

Latest revision as of 03:25, 3 July 2024

scientific article
Language Label Description Also known as
English
Detecting patterns in finite regular and context-free languages
scientific article

    Statements

    Detecting patterns in finite regular and context-free languages (English)
    0 references
    0 references
    0 references
    2 September 2010
    0 references
    formal languages
    0 references
    pattern matching
    0 references
    finite automaton
    0 references
    regular language
    0 references
    context-free language
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references