scientific article
From MaRDI portal
Publication:4051631
zbMath0297.68062MaRDI QIDQ4051631
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The emptiness problem for valence automata over graph monoids, The generative power of delegation networks, Parikh's theorem: a simple and direct automaton construction, Permutations are not context-free: An application of the interchange lemma, A decomposition theorem for hyper-algebraic extensions of language families, A strong pumping lemma for context-free languages, Iterating iterated substitution, A simplified proof of Parikh's theorem, Effective constructions in well-partially-ordered free monoids, Counting productions in context-free derivations, Fuzzy pushdown automata, Fuzzy context-free languages. I: Generalized fuzzy context-free grammars, Hierarchies of hyper-AFLs, Extended macro grammars and stack controlled machines
