Deciding regularity of hairpin completions of regular languages in polynomial time (Q714734): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:59, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deciding regularity of hairpin completions of regular languages in polynomial time |
scientific article |
Statements
Deciding regularity of hairpin completions of regular languages in polynomial time (English)
0 references
11 October 2012
0 references
hairpin completion
0 references
regular language
0 references
finite automaton
0 references
unambiguous linear language
0 references
rational growth
0 references
