IT IS NL-COMPLETE TO DECIDE WHETHER A HAIRPIN COMPLETION OF REGULAR LANGUAGES IS REGULAR (Q3224950)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | IT IS NL-COMPLETE TO DECIDE WHETHER A HAIRPIN COMPLETION OF REGULAR LANGUAGES IS REGULAR |
scientific article |
Statements
IT IS NL-COMPLETE TO DECIDE WHETHER A HAIRPIN COMPLETION OF REGULAR LANGUAGES IS REGULAR (English)
0 references
13 March 2012
0 references
automata
0 references
formal languages
0 references
regular languages
0 references
finite automata
0 references
NL-complete problems
0 references
DNA-computing
0 references
hairpin completion
0 references
0 references
