Login / Signup
On a hierarchy of 5′ → 3′ sensing Watson-Crick finite automata languages.
Benedek Nagy
Published in:
J. Log. Comput. (2013)
Keyphrases
</>
finite automata
grammatical inference
regular languages
regular expressions
deterministic automata
probabilistic automata
tree automata
inductive inference
context free grammars
sensor networks
finite automaton
context free
hidden markov models
data acquisition
high level
xml data
object oriented
keywords