On String Reading Stateless Multicounter 5′ → 3′ Watson-Crick Automata - (Extended Abstract).
László HegedüsBenedek NagyPublished in: UCNC (2013)
Keyphrases
- extended abstract
- regular expressions
- finite automaton
- finite automata
- edit distance
- string matching
- finite state
- data structure
- finite state automata
- deterministic automata
- finite state machines
- pattern matching
- cellular automata
- query language
- regular languages
- natural language
- tree automata
- binary strings
- matching algorithm
- context free grammars
- publish subscribe systems
- variable length
- note taking
- timed automata
- learning algorithm