scientific article
From MaRDI portal
Publication:3766878
zbMath0629.68075MaRDI QIDQ3766878
Holger Petersen, Matthias Jantzen
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
context-free languagesalgebraic closurePetri net languagecontext-free setcancellation grammarsDyck reduction
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Thue and Post systems, etc. (03D03)
Related Items (4)
Cancellation in context-free languages: enrichment by reduction ⋮ \(\mathcal{L}\)-reduction computation revisited ⋮ Refining the hierarchy of blind multicounter languages and twist-closed trios. ⋮ On the computing powers of \(\mathcal{L}\)-reductions of insertion languages
This page was built for publication:
