Inference of bounded L systems with polymorphic P systems

DOI10.1007/S41965-019-00007-0zbMATH Open1431.68055OpenAlexW2914578776MaRDI QIDQ2299882FDOQ2299882

Authors: Gábor Román 

Publication date: 24 February 2020

Published in: Journal of Membrane Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41965-019-00007-0

Recommendations

• Algorithms for inferring context-sensitive L-systems
• On the decidability of the existence of polyhedral invariants in transition systems
• Decidability of reachability for polymorphic systems with arrays: a complete classification
• Polymorphic P systems
• The polynomial bounds of proof complexity in Frege systems
• P systems based computing polynomials: design and formal verification
• Correct Hardware Design and Verification Methods
• Inference of polynomial invariants for imperative programs: a farewell to Gröbner bases
• scientific article; zbMATH DE number 3868655

zbMATH Keywords

inferenceL-systemslinear-bounded automatapolymorphic P-systems

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Computing with membranes
• Membrane computing. An introduction.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Grammatical inference. Learning automata and grammars.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Topics in Grammatical Inference
• Grammatical inference: Theoretical results and applications. 10th international colloquium, ICGI 2010, Valencia, Spain, September 13--16, 2010. Proceedings
• Classes of languages and linear-bounded automata
• L systems
• Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology
• Three theorems on phrase structure grammars of type 1
• Polymorphic P systems

Cited In (3)

• A bibliometric analysis of membrane computing (1998--2019)
• Solution to PSPACE-complete problem using P systems with active membranes with time-freeness
• Polymorphic P Systems with Non-cooperative Rules and No Ingredients

This page was built for publication: Inference of bounded L systems with polymorphic P systems

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