Abstract
Motivated by biomolecular computing, forbidding-enforcing systems (fe-systems) were first used to define classes of languages (fe-families) based on boundary conditions. This paper presents a new model of fe-systems in which fe-systems define single languages (fe-languages) based on forbidden and enforced subwords. The paper characterizes well-known languages by fe-systems, investigates the relationship between fe-families and fe-languages, and describes how an fe-system can generate the solution to the k-colorability problem and model splicing.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cavaliere, M., Jonoska, N.: Forbidding and enforcing in membrane computing. Natural Computing 2, 215–228 (2003)
Ehrenfeucht, A., Hoogeboom, H.J., Rozenberg, G., van Vugt, N.: Forbidding and enforcing. In: Winfree, E., Gifford, D.K. (eds.) DNA Based Computers V. AMS DIMACS, Providence, RI, vol. 54, pp. 195–206 (2001)
Ehrenfeucht, A., Hoogeboom, H.J., Rozenberg, G., van Vugt, N.: Sequences of languages in forbidding-enforcing families. Soft Computing 5(2), 121–125 (2001)
Ehrenfeucht, A., Rozenberg, G.: Forbidding-enforcing systems. Theoretical Computer Science 292, 611–638 (2003)
Franco, G., Jonoska, N.: Forbidding and Enforcing Conditions in DNA Self-assembly of Graphs. Nanotechnology: Science and Computation, Natural Computing Series, Part I 105–118 (2006)
Genova, D.: Forbidding and Enforcing of Formal Languages, Graphs and Partially Ordered Sets, PhD Thesis, University of South Florida (2007)
Genova, D., Jonoska, N.: Defining structures through forbidding and enforcing constraints. Physica B: Condensed Matter 394(2), 306–310 (2007)
Genova, D., Jonoska, N.: Topological Properties of Forbidding-Enforcing Systems. Journal of Automata, Languages and Combinatorics 11(4), 375–397 (2006)
Head, T.: Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bull. Math. Biology 49(6), 737–759 (1987)
Head, T., Păun, G., Pixton, D.: Language theory and molecular genetics: generative mechanisms suggested by DNA recombination. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 2, pp. 295–360. Springer, Berlin (1996)
Jonoska, N., Sa-Ardyen, P., Seeman, N.C.: Computation by self-assembly of DNA graphs. Journal of Genetic Programming And Evolvable Machines 4(2), 123–138 (2003)
Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)
Păun, G., Rozenberg, G., Salomaa, A.: Computing by splicing. Theoretical Computer Science 168, 321–336 (1996)
Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing, new computing paradigms. Springer, Heidelberg (1998)
van Vugt, N.: Models of Molecular Computing, PhD thesis, Leiden University (2002)
Winfree, E., Yang, X., Seeman, N.C.: Universal Computation via Self-assembly of DNA: Some Theory and Experiments. In: Landweber, L., Baum, E. (eds.) DNA computers II. AMS DIMACS series, vol. 44, pp. 191–198 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Genova, D. (2011). Defining Languages by Forbidding-Enforcing Systems. In: Löwe, B., Normann, D., Soskov, I., Soskova, A. (eds) Models of Computation in Context. CiE 2011. Lecture Notes in Computer Science, vol 6735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21875-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-21875-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21874-3
Online ISBN: 978-3-642-21875-0
eBook Packages: Computer ScienceComputer Science (R0)