scientific article; zbMATH DE number 4124977
From MaRDI portal
Publication:4205065
zbMath0686.68003MaRDI QIDQ4205065
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexityrewriting systemsregular languagesLindenmayer systemsgrammarsSolvabilitycontext free languagesPost correspondence problemcontext free grammarsclosure properties of language classesUnsolvabilityLL(k)LR(k)type 0 languages
Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (2)
A new class of C.F.L. for which the equivalence is decidable ⋮ Transactions and contracts based on reaction systems
This page was built for publication: