Defining Languages by Forbidding-Enforcing Systems

DOI10.1007/978-3-642-21875-0_10zbMath1344.68118OpenAlexW2123768651MaRDI QIDQ3091444

Daniela Genova

Publication date: 9 September 2011

Published in: Models of Computation in Context (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21875-0_10

zbMATH Keywords

formal languagessplicing\(k\)-colorability problembiomolecular computingfe-languagesfe-families

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Forbidding and enforcing on graphs ⋮ Finite language forbidding-enforcing systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Computing by splicing
• Forbidding and enforcing in membrane computing
• Sequences of languages in forbidding-enforcing families
• Forbidding--enforcing systems

This page was built for publication: Defining Languages by Forbidding-Enforcing Systems