Non-returning PC grammar systems generate any recursively enumerable language with eight context-free components
From MaRDI portal
Publication:3517110
DOI10.25596/JALC-2007-307zbMATH Open1149.68044MaRDI QIDQ3517110
Author name not available (Why is that?)
Publication date: 12 August 2008
No records found.
No records found.
This page was built for publication: Non-returning PC grammar systems generate any recursively enumerable language with eight context-free components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3517110)