DOI10.1016/0020-0190(83)90037-6zbMath0526.68068OpenAlexW2005135112MaRDI QIDQ594604
Erkki Maekinen
Publication date: 1983 Published in: Information Processing Letters (Search for Journal in Brave) Full work available at URL: https://doi.org/10.1016/0020-0190(83)90037-6
zbMATH Keywords
polynomial time algorithmbounded languageleft Szilard languageunambiguous context-free grammars
Mathematics Subject Classification ID
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)
Cites Work