Deciding regularity of hairpin completions of regular languages in polynomial time (Q714734)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Deciding regularity of hairpin completions of regular languages in polynomial time |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0 references
0.9605100750923156
0 references
0.9527742862701416
0 references
0.9147782325744628
0 references
0.867915689945221
0 references
0.8644562363624573
0 references
