Detecting patterns in finite regular and context-free languages (Q990125): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2056080555 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 0906.3220 / rank | |||
Normal rank | |||
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
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