Inference of bounded L systems with polymorphic P systems

DOI10.1007/S41965-019-00007-0zbMath1431.68055OpenAlexW2914578776MaRDI QIDQ2299882

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

zbMATH Keywords

inferenceL-systemslinear-bounded automatapolymorphic P-systems

Mathematics Subject Classification ID

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

Related Items (2)

A bibliometric analysis of membrane computing (1998--2019) ⋮ Solution to PSPACE-complete problem using P systems with active membranes with time-freeness

Cites Work

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

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