Theoretical Computer Science - Special issue on universal machines and computations
Language theory and molecular genetics: generative mechanisms suggested by DNA recombination
Handbook of formal languages, vol. 2
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Theoretical Computer Science - Algorithms,automata, complexity and games
Computation by Self-assembly of DNA Graphs
Genetic Programming and Evolvable Machines
Forbidding and enforcing in membrane computing
Natural Computing: an international journal
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Forbidding and enforcing of formal languages, graphs, and partially ordered sets
Forbidding and enforcing of formal languages, graphs, and partially ordered sets
Topological properties of forbidding-enforcing systems
Journal of Automata, Languages and Combinatorics
Forbidding and enforcing on graphs
Theoretical Computer Science
Forbidding sets and normal forms for language forbidding-enforcing systems
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Generating DNA code words using forbidding and enforcing systems
TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing
| Hi-index | 0.00 |
Motivated by biomolecular computing, forbidding-enforcing systems (fe-systems) were first used to define classes of languages (fefamilies) 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 fefamilies and fe-languages, and describes how an fe-system can generate the solution to the k-colorability problem and model splicing.