Finite language forbidding-enforcing systems

DOI10.1007/978-3-319-58741-7_25zbMath1489.68125OpenAlexW2612997448MaRDI QIDQ2011661

Hendrik Jan Hoogeboom, Daniela Genova

Publication date: 4 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-58741-7_25

zbMATH Keywords

regular languagesnatural computingfe-systemsbiomolecular computing(strictly) locally testablefe-languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• Unnamed Item
• Unnamed Item
• Forbidding and enforcing on graphs
• On regularity of context-free languages
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Forbidding and enforcing in membrane computing
• Sequences of languages in forbidding-enforcing families
• Forbidding--enforcing systems
• Existence of constants in regular splicing languages
• Forbidding Sets and Normal Forms for Language Forbidding-Enforcing Systems
• Defining Languages by Forbidding-Enforcing Systems
• Reaction Systems: A Model of Computation Inspired by Biochemistry
• Language Forbidding-Enforcing Systems Defining DNA Codewords

This page was built for publication: Finite language forbidding-enforcing systems