Finite language forbidding-enforcing systems
From MaRDI portal
Publication:2011661
Recommendations
- Defining languages by forbidding-enforcing systems
- Forbidding Sets and Normal Forms for Language Forbidding-Enforcing Systems
- Generalized forbidding grammars
- Sequences of languages in forbidding-enforcing families
- scientific article; zbMATH DE number 1195268
- Enforcing regular languages
- scientific article; zbMATH DE number 1998341
- Finite-word hyperlanguages
- Finite Orbits of Language Operations
- scientific article; zbMATH DE number 4009838
Cites work
- Defining languages by forbidding-enforcing systems
- Existence of constants in regular splicing languages
- Forbidding and enforcing in membrane computing
- Forbidding and enforcing on graphs
- Forbidding Sets and Normal Forms for Language Forbidding-Enforcing Systems
- Forbidding--enforcing systems
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- scientific article; zbMATH DE number 1142311 (Why is no real title available?)
- scientific article; zbMATH DE number 1568809 (Why is no real title available?)
- Language Forbidding-Enforcing Systems Defining DNA Codewords
- On regularity of context-free languages
- Reaction Systems: A Model of Computation Inspired by Biochemistry
- Sequences of languages in forbidding-enforcing families
Cited in
(8)- Forbidding--enforcing systems
- Forbidding Sets and Normal Forms for Language Forbidding-Enforcing Systems
- Defining languages by forbidding-enforcing systems
- Topological properties of forbidding-enforcing systems
- scientific article; zbMATH DE number 4062635 (Why is no real title available?)
- Forbidding and enforcing on graphs
- Enforcing regular languages
- Language Forbidding-Enforcing Systems Defining DNA Codewords
This page was built for publication: Finite language forbidding-enforcing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011661)