Computer Science – Formal Languages and Automata Theory
Scientist
Computer Science
Formal Languages and Automata Theory
Scientist
Deciding if a Regular Language is Generated by a Splicing System
Deciding Regularity of Hairpin Completions of Regular Languages in Polynomial Time
It Is NL-complete to Decide Whether a Hairpin Completion of Regular Languages Is Regular
Iterated Hairpin Completions of Non-crossing Words
On the Iterated Hairpin Completion
No associations
LandOfFree
Steffen Kopecki does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Steffen Kopecki, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Steffen Kopecki will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-217472