research-article

On Watson-Crick automata

Authors:

K. G. Subramanian,

Ibrahim VenkatAuthors Info & Claims

CCSEIT '12: Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology

Pages 151 - 156

https://doi.org/10.1145/2393216.2393242

Published: 26 October 2012 Publication History

Abstract

Motivated by Watson-Crick automata, we introduce here a grammar counterpart called a Watson-Crick regular grammar that has rules as in a regular grammar but involves double stranded strings. The language generated by this grammar consists of strings in the upper strands of the double stranded strings related by a complementarity relation. We obtain some properties of these grammars and also indicate an application to generation of chain code pictures.

References

[1]

E. Czeizler, E. Czeizler, A short Survey on Watson-Crick Automata, Bull. Eur. Assoc. Theor. Comp. Sci., EATCS 88 (2006) 104--119.

[2]

J. Dassow and F. Hinz, Decision problems and regular chain code picture languages, Discrete Appl. Math. 45 (1993) 29--49.

Digital Library

[3]

H. Freeman, On the encoding of arbitrary geometric configurations, IRE Transactions on Electronic Computers 10 (1961) 260--268.

[4]

R. Freund, Gh. Paun, G. Rozenberg, A. Salomaa, Watson-Crick finite Automata, Proc. 3rd DIMACS Workshop on DNA based Computers, Philadelphia, (1997) 297--328.

[5]

J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Complexity, Addison-Wesley, Reading, 1979.

Digital Library

[6]

Ch. Kim, Complexity and decidability for restricted classes of picture languages, Theor. Comp. Sci. 73 (1990) 295--311.

Digital Library

[7]

H. W. Maurer, G. Rozenberg and E. Welzl, Using string languages to describe picture languages, Inform. Control 54 (1982) 155--185.

[8]

H. A. Maurer, A. Salomaa, D. Wood, Pure Grammars, Information and Control, 44 (1980) 47--72.

[9]

S. Okawa, S. Hirose, The relations among Watson-Crick Automata and their Relations with Context-free Languages, IEICE Trans. Inf. Syst., E89-D(10) (2006) 2591--2599.

Digital Library

[10]

Gh. Paun, G. Rozenberg, A. Salomaa, DNA Computing: New Paradigms, Springer-Verlag, Berlin, 1998.

[11]

Gh. Paun, A. Salomaa, From DNA Recombination to DNA Computing Via Formal Languages, Lecture Notes in Computer Science, Springer, Vol. 1278, 1996, 93--98.

Digital Library

[12]

A. Rosenfeld and R. Siromoney, Picture languages - a survey, Languages of Design 1 (1993) 229--245.

Digital Library

[13]

A. Salomaa, Formal Languages, Academic Press, New York, 1973.

Digital Library

[14]

K. G. Subramanian, I. Venkat, K. Mahalingam, Context-free Systems with a complementarity relation, IEEE Proc. Sixth Int. Conf. Bio-Inspired Computing: Theories and Applications, 194--198, 2011.

Digital Library

[15]

I. H. Sudborough and E. Welzl, Complexity and decidability of chain code picture languages, Theor. Comp. Sci. 36 (1985) 175--202.

Digital Library

Cited By

Hammer JKřivka Z(2022)Practical Aspects of Membership Problem of Watson-Crick Context-free GrammarsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.367.7367(88-111)Online publication date: 27-Aug-2022
https://doi.org/10.4204/EPTCS.367.7
Mohamad Zulkufli NTuraev SMohd Tamrin MMessikh A(2019)Generative Power and Closure Properties of Watson-Crick GrammarsApplied Computational Intelligence and Soft Computing10.1155/2016/94819712016(1)Online publication date: 18-Nov-2019
https://dl.acm.org/doi/10.1155/2016/9481971
Mohamad Zulkufli NTuraev SMohd Tamrin MMessikh A(2019)Watson-Crick Linear GrammarsProceedings of the International Conference on Data Engineering 2015 (DaEng-2015)10.1007/978-981-13-1799-6_42(403-412)Online publication date: 10-Aug-2019
https://doi.org/10.1007/978-981-13-1799-6_42
Show More Cited By

Index Terms

On Watson-Crick automata
1. Theory of computation

Recommendations

Watson-Crick D0L systems

The properties of Watson Crick D0L system, a language theoretical formalism inspired by natural DNA processing, are studied. The model incorporates the iterated D0L-like morphism and the DNA complementarity principle represented by a letter-to-letter ...
Universal computation with Watson-Crick DOL systems

Watson-Crick D0L systems, introduced in 1997 by Mihalache and Salomaa, arise from two major principles: the Lindenmayer rewriting and the Watson-Crick complementarity principle. Complementarity can be viewed as a purely language-theoretic operation. ...
State complexity of deterministic Watson---Crick automata and time varying Watson---Crick automata

Watson---Crick automata are finite automata working on double strands. Extensive research work has already been done on non-deterministic Watson---Crick automata and on deterministic Watson---Crick automata. State complexity of Watson---Crick automata ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

CCSEIT '12: Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology

October 2012

800 pages

ISBN:9781450313100

DOI:10.1145/2393216

General Chairs:
Natarajan Meghanathan
Jackson State University
,
Michal Wozniak
Wroclaw University of Technology, Poland

Copyright © 2012 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Avinashilingam University: Avinashilingam University

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 October 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Ministry of Higher Education, Malaysia

Conference

CCSEIT '12

Sponsor:

Avinashilingam University

CCSEIT '12: The Second International Conference on Computational Science, Engineering

October 26 - 28, 2012

Coimbatore UNK, India

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
116
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 24 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Hammer JKřivka Z(2022)Practical Aspects of Membership Problem of Watson-Crick Context-free GrammarsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.367.7367(88-111)Online publication date: 27-Aug-2022
https://doi.org/10.4204/EPTCS.367.7
Mohamad Zulkufli NTuraev SMohd Tamrin MMessikh A(2019)Generative Power and Closure Properties of Watson-Crick GrammarsApplied Computational Intelligence and Soft Computing10.1155/2016/94819712016(1)Online publication date: 18-Nov-2019
https://dl.acm.org/doi/10.1155/2016/9481971
Mohamad Zulkufli NTuraev SMohd Tamrin MMessikh A(2019)Watson-Crick Linear GrammarsProceedings of the International Conference on Data Engineering 2015 (DaEng-2015)10.1007/978-981-13-1799-6_42(403-412)Online publication date: 10-Aug-2019
https://doi.org/10.1007/978-981-13-1799-6_42
Mohamad Zulkufli NTuraev STamrin MMessikh A(2017)The Computational Power of Watson-Crick Grammars: RevisitedBio-inspired Computing – Theories and Applications10.1007/978-981-10-3611-8_20(215-225)Online publication date: 8-Jan-2017
https://doi.org/10.1007/978-981-10-3611-8_20
Zulkufli NTuraev STamrin MMessikh AAlshaikhli I(2015)Computational Properties of Watson-Crick Context-Free Grammars2015 4th International Conference on Advanced Computer Science Applications and Technologies (ACSAT)10.1109/ACSAT.2015.19(186-191)Online publication date: Dec-2015
https://doi.org/10.1109/ACSAT.2015.19
Zulkufli NTuraev STamrin MAzeddine M(2015)Closure properties of Watson-Crick grammars10.1063/1.4937082(040032)Online publication date: 2015
https://doi.org/10.1063/1.4937082

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents