scientific article
From MaRDI portal
Publication:3471701
zbMath0695.68054MaRDI QIDQ3471701
Manfred Kudlek, Holger Petersen, Matthias Jantzen
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Word problems, etc. in computability and recursion theory (03D40)
Related Items (4)
Cancellation in context-free languages: enrichment by reduction ⋮ Normal forms for phrase-structure grammars ⋮ \(\mathcal{L}\)-reduction computation revisited ⋮ On the computing powers of \(\mathcal{L}\)-reductions of insertion languages
This page was built for publication:
