Pages that link to "Item:Q1075776"
From MaRDI portal
The following pages link to String-matching cannot be done by a two-head one-way deterministic finite automaton (Q1075776):
Displaying 7 items.
- One-reversal counter machines and multihead automata: revisited (Q714812) (← links)
- String-matching cannot be done by a two-head one-way deterministic finite automaton (Q1075776) (← links)
- Remarks on string-matching and one-way multihead automata (Q1108049) (← links)
- Three one-way heads cannot do string matching (Q1318467) (← links)
- Saving comparisons in the Crochemore-Perrin string-matching algorithm (Q1365685) (← links)
- String matching with simple devices (Q2380036) (← links)
- One-Reversal Counter Machines and Multihead Automata: Revisited (Q3075514) (← links)
