dP Automata versus Right-Linear Simple Matrix Grammars

DOI10.1007/978-3-642-27654-5_29zbMath1353.68170OpenAlexW192265048MaRDI QIDQ2891327

Mario J. Pérez-Jiménez, Gheorghe Păun

Publication date: 15 June 2012

Published in: Computation, Physics and Beyond (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/xmlui/handle/11441/39574

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (2)

Solving the N-queens problem using dP systems with active membranes ⋮ Languages of distributed reaction systems

Cites Work

• An infinite hierarchy of languages defined by dP systems
• P and dP Automata: A Survey
• Simple matrix languages
• Unnamed Item
• Unnamed Item

This page was built for publication: dP Automata versus Right-Linear Simple Matrix Grammars