State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata.
Kumar Sankar RayKingshuk ChatterjeeDebayan GangulyPublished in: Nat. Comput. (2015)
Keyphrases
- finite state automaton
- finite state machines
- turing machine
- cellular automata
- state space
- finite state
- regular expressions
- probabilistic automata
- formal language theory
- tree automata
- finite automata
- information systems
- artificial intelligence
- sufficient conditions
- worst case
- relational databases
- neural network
- database