Theoretical Computer Science
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
Handbook of formal languages, vol. 3
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
Defining languages by forbidding-enforcing systems
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
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 |
Forbidding-enforcing systems (fe-systems) define classes of languages (fe-families) based on boundary conditions. We characterize f-families having not necessarily finite forbidders and prove that none of the Chomsky families of languages can be defined with an fe-system, hence, fe-systems provide a completely new way of defining classes of languages. We show that f-families map to f-families by morphic maps if and only if the morphism maps symbol to symbol. A morphism mapping e-families to e-families is necessarily surjective.