Systolic Automata and P Systems
From MaRDI portal
Publication:2944875
DOI10.1007/978-3-319-13350-8_2zbMath1323.68269OpenAlexW189663465MaRDI QIDQ2944875
Giovanni Pardini, Paolo Milazzo, Andrea Maggiolo-Schettini, Roberto Barbuti, Simone Tini
Publication date: 8 September 2015
Published in: Computing with New Resources (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-13350-8_2
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spatial P systems
- On a family of L languages resulting from systolic tree automata
- Using well-structured transition systems to decide divergence for catalytic P systems
- A rewriting logic framework for operational semantics of membrane systems
- Compositional semantics and behavioral equivalences for P systems
- Compositional semantics of spiking neural P systems
- Systolic automata for VLSI on balanced trees
- Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
- Succinctness of descriptions of SBTA-languages
- Membrane computing. An introduction.
- An intermediate language for the stochastic simulation of biological systems
- Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata
- Simulation of spatial P system models
- Membrane Systems Working in Generating and Accepting Modes: Expressiveness and Encodings
- AN OVERVIEW ON OPERATIONAL SEMANTICS IN MEMBRANE COMPUTING
- SIMULATION OF SYSTOLIC TREE AUTOMATA ON TRELLIS AUTOMATA
- Systolic trellis automatata †
- Systolic trellis automatat†
This page was built for publication: Systolic Automata and P Systems
