Full AFLs and nested iterated substitution
From MaRDI portal
Publication:5581626
DOI10.1016/S0019-9958(70)80039-0zbMath0188.03102MaRDI QIDQ5581626
Publication date: 1970
Published in: Information and Control (Search for Journal in Brave)
Related Items
Cancellation in context-free languages: enrichment by reduction, On Grammars Controlled by Parikh Vectors, Pushdown machines for the macro tree transducer, Transducers and the decidability of independence in free monoids, High level tree transducers and iterated pushdown tree transducers, The OI-hierarchy is closed under control, Chains of full AFL's, On the word problem for special monoids, Unnamed Item, Tree transducers, L systems, and two-way machines, MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS, On the word problem for weakly compressible monoids, An application of iterative pushdown automata to contour words of balls and truncated balls in hyperbolic tessellations, Iterated linear control and iterated one-turn pushdowns, On the word problem for free products of semigroups and monoids, Characterizations of regular and context-free matrices, Unnamed Item, Monadic Thue systems, Iterated stack automata and complexity classes, On incomparable abstract family of languages (AFL), Picture languages: tiling systems versus tile rewriting grammars., Continuous operations on languages, Iterated pushdown automata and sequences of rational numbers, Basic tree transducers, Look-ahead on pushdowns, Commutative grammars, Ogden's lemma, multiple context-free grammars, and the control language hierarchy, Iterating iterated substitution, Effective constructions in well-partially-ordered free monoids, Compelled operations and operations of degreeP, On the family of finite index matrix languages, Syntactic operators on full semiAFLs, On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems, Principal abstract families of weighted tree languages, Regular sets over extended tree structures, Substitution expressions, A generalization of Parikh's semilinear theorem, Theory of formal grammars, Fuzzy context-free languages. I: Generalized fuzzy context-free grammars, Insertion languages, Hierarchies of hyper-AFLs, Extended macro grammars and stack controlled machines, Iteration of rational transductions, Algebraic aspects of families of fuzzy languages
