State and transition complexity of Watson-Crick finite automata
We consider the number of states and the number of transitions in Watson-Crick finite (non-deterministic) automata as descriptional complexity measures. The succinctness of recognizing regular languages by Watson-Crick (arbitrary or 1-limited) automata in comparison with non-deterministic finite automata is investigated, as well as decidability and computability questions. Major differences are found between finite automata and Watson-Crick finite automata from both these points of view.
KeywordsTransition Rule Transition Complexity Regular Language Finite Automaton Descriptional Complexity
Unable to display preview. Download preview PDF.
- 1.C. Câmpeanu, N. Sântean, S. Yu, Minimal cover-automata for finite languages, International Workshop on Implementing Automata, WIA 98, Rouen, 1998, 32–42.Google Scholar
- 2.J. Dassow, Gh. Păun, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, 1989.Google Scholar
- 4.R. Freund, Gh. Păun, G. Rozenberg, A. Salomaa, Watson-Crick finite automata, Proc. of the Third Annual DIMACS Symp. on DNA Based Computers, Philadelphia, 1997, 305–317.Google Scholar
- 5.R. Freund, Gh. Păun, G. Rozenberg, A. Salomaa, Watson-Crick automata, Technical Report 97-13, Dept. of Computer Sci., Leiden Univ., 1997.Google Scholar
- 6.J. Gruska, Descriptional complexity of context-free languages, Proc. MFCS’ 73, High Tatras, 1973, 71–83.Google Scholar
- 13.S. Yu, Regular languages, Chapter 2 in vol. 1 of , 41–110.Google Scholar