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
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
Defining languages by forbidding-enforcing systems
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
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 |
This paper investigates ways to reduce redundancy in forbidding sets for language forbidding-enforcing systems. A language forbidding set disallows combinations of subwords in a word, while permitting the presence of some parts of these combinations. Since a forbidding set is a potentially infinite set of finite sets of words, finding normal forms for forbidding sets is interesting from a combinatorics on words perspective and important for the theoretical investigation of language fe-systems, the connection between variants of fe-systems, and their applications to molecular computation. This paper shows that the minimal normal forms for forbidding sets defining classes of languages (fe-families) are also normal forms for forbidding sets defining single languages (fe-languages), but not necessarily minimal. Thus, an investigation of minimality and sufficient conditions for fe-languages are presented and it is shown that in special cases they coincide with a minimal normal form for fe-families.