Membrane systems languages are polynomial-time parsable
From MaRDI portal
Publication:652889
zbMath1232.68049MaRDI QIDQ652889
Constantin Ciubotaru, Sergiu Ivanov, Yurii Rogozhin, Artiom Alhazov
Publication date: 5 January 2012
Published in: Computer Science Journal of Moldova (Search for Journal in Brave)
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
This page was built for publication: Membrane systems languages are polynomial-time parsable