References

  1. Kingshuk Chatterjee & Kumar Sankar Ray (2017): Watson-Crick Pushdown Automata. Kybernetika 53(5), pp. 868–876, doi:10.14736/kyb-2017-5-0868.
  2. Elena Czeizler & Eugen Czeizler (2006): A Short Survey on Watson-Crick Automata. Bull. EATCS 88, pp. 104–119.
  3. Rudolf Freund, Gheorghe Paun, Grzegorz Rozenberg & Arto Salomaa (1997): Watson-Crick Finite Automata. In: Harvey Rubin & David Harlan Wood: DNA Based Computers, Proceedings of a DIMACS Workshop, Philadelphia, Pennsylvania, USA, June 23-25, 1997, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 48. DIMACS/AMS, pp. 297–328, doi:10.1090/dimacs/048/22.
  4. Jan Hammer (2022): Watson-Crick Models for Formal Language Processing. Master's thesis. Brno University of Technology, Faculty of Information Technology.
  5. John E. Hopcroft, Rajeev Motwani & Jeffrey D. Ullman (2001): Introduction to automata theory, languages, and computation, 2nd edition. SIGACT news 32(1), pp. 60–65, doi:10.1145/568438.568455.
  6. Dietrich Kuske & Peter Weigel (2004): The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems. In: Developments in Language Theory, Lecture Notes in Computer Science. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 272–283, doi:10.1007/978-3-540-30550-7_23.
  7. Nurul Liyana Mohamad Zulkufli, Sherzod Turaev, Mohd Izzuddin Mohd Tamrin & Azeddine Messikh (2016): Generative Power and Closure Properties of Watson-Crick Grammars. Applied computational intelligence and soft computing 2016, pp. 1–12, doi:10.1155/2016/9481971.
  8. Nurul Liyana Mohamad Zulkufli, Sherzod Turaev, Mohd Izzuddin Mohd Tamrin & Azeddine Messikh (2018): Watson-Crick Context-Free Grammars: Grammar Simplifications and a Parsing Algorithm. The Computer Journal 61(9), pp. 1361–1373, doi:10.1093/comjnl/bxx128.
  9. Nurul Liyana Mohamad Zulkufli, Sherzod Turaev, Mohd Izzuddin Mohd Tamrin & Azeddine Messikh (2017): The Computational Power of Watson-Crick Grammars: Revisited. In: Bio-inspired Computing – Theories and Applications, Communications in Computer and Information Science 681. Springer Singapore, Singapore, pp. 215–225, doi:10.1007/978-981-10-3611-8_20.
  10. Gheorghe Păun, Grzegorz Rozenberg & Arto Salomaa (1998): DNA Computing: New Computing Paradigms. Texts in Theoretical Computer Science. An EATCS Series. Springer Berlin Heidelberg, Berlin, Heidelberg, doi:10.1007/978-3-662-03563-4.
  11. K. G. Subramanian, S. Hemalatha & Ibrahim Venkat (2012): On Watson-Crick Automata. In: Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology, CCSEIT '12. Association for Computing Machinery, New York, NY, USA, pp. 151–156, doi:10.1145/2393216.2393242.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org