The following pages link to (Q4263694):
Displaying 5 items.
- On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
- Using DNA to solve the bounded Post correspondence problem (Q1575917) (← links)
- On path-controlled insertion-deletion systems (Q1713412) (← links)
- Universal insertion grammars of size two (Q2004002) (← links)
- On bonded sequential and parallel insertion systems (Q5223612) (← links)