Systolic automata and P systems

DOI10.1007/978-3-319-13350-8_2MaRDI QIDQ2944875zbMATH OpenOpenAlexFDO

Authors Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Giovanni Pardini, 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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• scientific article; zbMATH DE number 3911718
• scientific article; zbMATH DE number 4108159
• C-tree systolic automata
• scientific article; zbMATH DE number 3898246
• Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata

Cites work

• scientific article; zbMATH DE number 4215381 (Why is no real title available?)
• scientific article; zbMATH DE number 5506889 (Why is no real title available?)
• scientific article; zbMATH DE number 3911718 (Why is no real title available?)
• scientific article; zbMATH DE number 2080936 (Why is no real title available?)
• scientific article; zbMATH DE number 3802813 (Why is no real title available?)
• A rewriting logic framework for operational semantics of membrane systems
• An intermediate language for the stochastic simulation of biological systems
• An overview on operational semantics in membrane computing
• Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
• Compositional semantics and behavioral equivalences for P systems
• Compositional semantics of spiking neural P systems
• Membrane computing. An introduction.
• Membrane systems working in generating and accepting modes: expressiveness and encodings
• Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata
• On a family of L languages resulting from systolic tree automata
• P systems with transport and diffusion membrane channels
• SIMULATION OF SYSTOLIC TREE AUTOMATA ON TRELLIS AUTOMATA
• Simulation of spatial P system models
• Spatial P systems
• Succinctness of descriptions of SBTA-languages
• Systolic automata for VLSI on balanced trees
• Systolic trellis automatata †
• Systolic trellis automatat†
• Using well-structured transition systems to decide divergence for catalytic P systems

Cited in

(1)

• Computing and Combinatorics

This page was built for publication: Systolic automata and P systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944875)