scientific article
From MaRDI portal
Publication:3859267
zbMath0424.68040MaRDI QIDQ3859267
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
rational functionsconescontext-free languagesfamilies of languagesrational transductionsiterative pairsclassification of the subfamilies of context-free sets
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Using finite transducers for describing and synthesising structural time-series constraints, Reachability problems on reliable and lossy queue automata, Recognizable subsets of the two letter plactic monoid, Decision problems for word-hyperbolic semigroups, Prognosis of \(\omega\)-languages for the diagnosis of *-languages: a topological perspective, Approximation of fuzzy context-free grammars, Separability of rational relations in \(A^* \times \mathbb N^m\) by recognizable relations is decidable, A Kleene characterization of computability, Notions of hyperbolicity in monoids., Termination proofs for string rewriting systems via inverse match-bounds, On regular realizability problems for context-free languages, Representation and uniformization of algebraic transductions, On the computation of quotients and factors of regular languages, Iterative and recursive matrix theories, Families of languages defined by ciliate bio-operations, Sur les générateurs algébriques et linéaires, On the rational subset problem for groups., Fixed points of endomorphisms over special confluent rewriting systems., A characterization of (regular) circular languages generated by monotone complete splicing systems, Kadanoff sand pile model. Avalanche structure and wave shape, Closure properties and complexity of rational sets of regular languages, Subsequential transducers: a coalgebraic perspective, Translating regular expression matching into transducers, Synchronizing relations on words, Tilings and submonoids of metabelian groups., Look-ahead removal for total deterministic top-down tree transducers, Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.), Boundary graph grammars with dynamic edge relabeling, Some decision problems about controlled rewriting systems, Probabilistic grammars and languages, On CD-systems of stateless deterministic R-automata with window size one, Unique decipherability in the monoid of languages: an application of rational relations, A standard correspondence on epicentral words, New techniques for proving the decidability of equivalence problem, A characterisation of deterministic context-free languages by means of right-congruences, Cyclic rational transductions and polynomials of rational functions, Distribution and synchronized automata, Easy multiplications. II: Extensions of rational semigroups, Closures of regular languages for profinite topologies., Fixed points of endomorphisms of trace monoids., Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids., Finiteness results for subgroups of finite extensions., Restarting transducers, regular languages, and rational relations, Language-theoretic problems in certain matrix monoids, A note on the commutative closure of star-free languages, Representations and complete semiring morphisms, Varieties and rational functions, The submonoid and rational subset membership problems for graph groups., Synchronization, \(\mathbb{N}\)-rationality of zeta functions, Equations over finite sets of words and equivalence problems in automata theory, Synchronized rational relations of finite and infinite words, On bounded rational trace languages, An optimal pre-determinization algorithm for weighted transducers, Well quasi-orders and context-free grammars, Deleting string rewriting systems preserve regularity, Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton, Equational tree transformations, Adding symbolic information to picture models: definitions and properties, Height reducing problem on algebraic integers, On suffix extensions in suffix trees, On the complexity of some extended word problems defined by cancellation rules, Expansions, free inverse semigroups, and Schützenberger product, Expressive power of \(\text{LL}(k)\) Boolean grammars, Finite state complexity, On the complexity of computing the profinite closure of a rational language, La reconnaissance des facteurs d'un mot dans un texte, HDTOL matching of computations of multitape automata, Inverse subsemigroups of finite index in finitely generated inverse semigroups, On the separability of sparse context-free languages and of bounded rational relations, Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al., Semi-synchronous transductions, Infinite periodic points of endomorphisms over special confluent rewriting systems, Small overlap monoids. II: Automatic structures and normal forms., Nivat's processing systems: decision problems related to protection and synchronization, A characterization of regular circular languages generated by marked splicing systems, The Parikh counting functions of sparse context-free languages are quasi-polynomials, Extended multi bottom-up tree transducers, Automatic presentations for semigroups., Rational subsets of polycyclic monoids and valence automata, The class of HDT0L sequences is closed with respect to rational functions, Systems of equations over a free monoid and Ehrenfeucht's conjecture, An algebraic characterization of some principal regulated rational cones, It is decidable whether a regular language is pure context-free, Infinite linear systems and one counter languages, Bicentres de langages algébriques, Cyclic derivation of noncommutative algebraic power series, An application of the matrix representation of transductions, Linear indexed languages, On the equivalence of some transductions involving letter to letter morphisms on regular languages, The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids, Hierarchies of hyper-AFLs, Partial commutations and faithful rational transductions, Commutative one-counter languages are regular, A homomorphic characterization of recursively enumerable languages, The equivalence problem of multitape finite automata, Limitedness theorem on finite automata with distance functions: An algebraic proof, Computation theoretic aspects of cellular automata, Extended automata-like regular expressions of star degree at most (2,1), On the power of synchronization in parallel computations, Regulated variants of limited context restarting automata, Specular sets, On omega context free languages which are Borel sets of infinite rank., On regular drawn symbolic picture languages, On Boolean closed full trios and rational Kripke frames, Word problems of groups: formal languages, characterizations and decidability, Many aspects of defect theorems, The synthesis of Petri nets from path-automatic specifications, Operations preserving regular languages, Two techniques in the area of the star problem in trace monoids, Some properties of Ising automata, Synchronization of musical words, Closure properties of locally finite \(\omega\)-languages, A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\), P systems with protein rules, Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types \(A_{n}\), \(B_{n}\), \(C_{n}\), \(D_{n}\), and \(G_{2}\), On fixed points of rational transductions, Rational subsets of partially reversible monoids, Learning finite-state models for machine translation, Finite turns and the regular closure of linear context-free languages, The word problem for nilpotent inverse monoids, The topological structure of fractal tilings generated by quadratic number systems, Undecidable problems of decentralized observation and control on regular languages, Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata, Dynamic modularity in discrete-time models of regulatory networks, A simple method for building bimachines from functional finite-state transducers, Lamplighter groups and automata, On the rational subsets of the free group, Some decisional problems on rational relations, A note on decidability questions on presentations of word semigroups, Restrictions and representations of vector controlled concurrent system behaviours, Quasi-automatic semigroups, Coding by minimal linear grammars, Deque automata, languages, and planar graph representations, Undecidable properties of monoids with word problem solvable in linear time. II: Cross sections and homological and homotopical finiteness conditions., Ambiguity in omega context free languages, Borel hierarchy and omega context free languages., McNaughton families of languages., On the transition graphs of Turing machines., On computability of data word functions defined by transducers, The monoid of queue actions, Transducer descriptions of DNA code properties and undecidability of antimorphic problems, On the descriptional complexity of stateless deterministic ordered restarting automata, Efficient algorithms for computing the inner edit distance of a regular language via transducers, The complexity of verbal languages over groups, Lexicographic decomposition of \(k\)-valued transducers, On the representation of finite deterministic 2-tape automata, A group-theoretical interpretation of the word problem for free idempotent generated semigroups, Refining the hierarchy of blind multicounter languages and twist-closed trios., Petri net languages and infinite subsets of \(\mathbb{N}^m\), Template-guided DNA recombination, A finiteness criterion for inverse semigroups, On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids, Cancellation rules and extended word problems, Semigroup automata with rational initial and terminal sets, Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet, Epsilon-reducible context-free languages and characterizations of indexed languages, On finite-index indexed grammars and their restrictions, General decidability results for asynchronous shared-memory programs: higher-order and beyond, Confluence up to garbage in graph transformation, Preservation of normality by transducers, Principal abstract families of weighted tree languages, A simple undecidable problem: Existential agreement of inverses of two morphisms on a regular language, Transducers and repetitions, Fixed point languages of rational transductions, On finitely generated submonoids of virtually free groups, Linear graph grammars: Power and complexity, Equidivisible Kleene monoids and the Elgot-Mezei theorem, Automata and rational expressions, Finite transducers and rational transductions, Weighted automata, Varieties, Repetitiveness of languages generated by morphisms, \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata, Minimization algorithms for sequential transducers, Characterization of Glushkov automata, Undecidability of existential properties in picture languages, Langages à un compteur, On prefixal one-rule string rewrite systems, Wreath product and infinite words, Automata equipped with auxiliary data structures and regular realizability problems, Determinization of transducers over finite and infinite words., Even linear simple matrix languages: formal language properties and grammatical inference., A structural property of regular frequency computations., Squaring transducers: An efficient procedure for deciding functionality and sequentiality., Minimizing subsequential transducers: a survey., Reducing space for index implementation., On-line digit set conversion in real base., Uniform and nonuniform recognizability., The star problem and the finite power property in trace monoids: Reductions beyond C4, Regular left-orders on groups, Iterating transducers, Uniform strategies, rational relations and jumping automata, Theoretical and implementational aspects of the formal language server (LaSer), Modelization of deterministic rational relations, Binary (generalized) Post Correspondence Problem, A short scientific biography of Maurice Nivat, Distances between languages and reflexivity of relations, The finite power property in free groups, Some properties of recognizable \(\mathcal Z\)-subsets, Monadic second-order definable graph transductions: a survey, Rational languages and the Burnside problem, Truncations of infinite matrices and algebraic series associated with some CF grammars, Systèmes codés. (Coded systems), Formal languages defined by uniform substitutions, Addition molle et fonctions p-locales, A note on the equivalence problem of rational formal power series, Context-free graph languages of bounded degree are generated by apex graph grammars, Well quasi-orders and regular languages, Rational equivalence relations, Representation of rational functions with prefix and suffix codings, The equivalence of finite valued transducers (on HDT0L languages) is decidable, Balance of many-valued transductions and equivalence problems, Algebraic languages and polyominoes enumeration, On regular trace languages, Polynomial closure of group languages and open sets of the Hall topology, Equivalences and transformations of regular systems - applications to recursive program schemes and grammars, The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index, Representations of language families by homomorphic equality operations and generalized equality sets, On the decidability of some problems about rational subsets of free partially commutative monoids, Thue systems as rewriting systems, Mixed product and asynchronous automata, Une note sur le théorème de caractérisation des générateurs algébriques. (A note on the characterization theorem for context-free generators), Easy multiplications. I: The realm of Kleene's theorem, Rational index of context-free languages in exp \(\Theta(^ p\sqrt{n})\) and \(n^{\Theta((\ln n)^{1/p})}\), Slightly commutative Kleene semigroups, The interchange or pump (di)lemmas for context-free languages, Linear numeration systems of order two, On recognizable subsets of free partially commutative monoids, Closure property of principal cones under substitution, La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire. (Recognition of the factors of a finite language in a text in linear time), Counting with rational functions, A unified framework for disambiguating finite transductions, Concatenation of inputs in a two-way automaton, Bifaithful starry transductions, Deciding the immutability of regular codes and languages under finite transduction, On the intersection of stacks and queues, Prefix and equality languages of rational functions are co-context-free, On the sequentiality of the successor function, The set of minimal words of a context-free language is context-free, Dynamical recognizers: real-time language recognition by analog computers, Monoides pointes, Langages sur des alphabets infinis, Eine neue Invariante für kontextfreie Sprachen, A propos du lemme de substitution, The simultaneous accessibility of two configurations of two equivalent DPDA's, Sur mon article Une topologie du monoide libre, Formes de langages et de grammaires, Substitution of semi-AFL's, Sub-regular grammar forms, Generalization of the Ginsburg-Rice Schuetzenberger fixed-point theorem for context-sensitive and recursive-enumerable languages, The inclusion of D0L in multi-reset, Langages satures et cônes decroissants. Langages et cônes bifideles, A note on morphic characterization of languages, On a language without star, Topologies for the free monoid, On commutative Kleene monoids, Which Kleene semigroups are finite?, Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems, Decidability problems for unary output sequential transducers, Rational indexes of generators of the cone of context-free languages, Inverse monoids and rational Schreier subsets of the free group, On a kind of Fatou property of context-free groups, AUTOMATE, a computing package for automata and finite semigroups, Linear numeration systems and \(\theta\)-representations, Nivat's theorem for pushdown transducers, The context-freeness of the languages associated with vector addition systems is decidable, Alphabetic tree relations, Rational relations and rational series, Multiplicities: A deterministic view of nondeterminism, Infinite trees and automaton-definable relations over \(\omega\)-words, Decidability of the star problem in \(A^*\times{}\{ b\}^*\), Closure of varieties of languages under products with counter, Confluent linear numeration systems, On the regularity of languages on a binary alphabet generated by copying systems, Inverse monoids and rational subsets of related groups, Stability for the zigzag submonoids, Group presentations, formal languages and characterizations of one- counter groups, Générateurs algébriques et systèmes de paires iterantes, Overlap-free words and finite automata, Transforming a single-valued transducer into a Mealy machine, A construction on finite automata that has remained hidden, A proof of Choffrut's theorem on subsequential functions, A characterization of recognizable picture languages by tilings by finite sets, Determinants and Möbius functions in trace monoids, On certain closure operators defined by families of semiring morphisms, Extending regular expressions with iterated shuffle, Extended macro grammars and stack controlled machines, Atomic semicommutations, The word problem of inverse monoids presented by one idempotent relator, A syntactic congruence for rational \(\omega\)-languages, Classes of regular and context-free languages over countably infinite alphabets, On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages, An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable, \(p\)-adic topology on words, Two decidability problems for infinite words, Recognizable trace languages, distributed automata and the distribution problem, Deterministic sequential functions, On the lengths of values in a finite transducer, On two families of forests, On Grammars Controlled by Parikh Vectors, Multi-sequential Word Relations, Deterministic Ordered Restarting Automata that Compute Functions, Unnamed Item, Synchronization of Regular Automata, Fixed points of endomorphisms of certain free products, An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable, A Disambiguation Algorithm for Finite Automata and Functional Transducers, Ranking and formal power series, Learning to verify branching time properties, A Logical Characterization of Timed Pushdown Languages, Two-Dimensional Rational Automata: A Bridge Unifying One- and Two-Dimensional Language Theory, On the usefulness of bifaithful rational cones, Automatic Kolmogorov complexity, normality, and finite-state dimension revisited, Two-way automaton computations, Context-free languages with rational index in $\Theta (n^\gamma )$ for algebraic numbers $\gamma $, Loops in automata and HDTOL relations, Unnamed Item, The emptiness problem for valence automata over graph monoids, A Circuit Complexity Approach to Transductions, Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus, Why We Need Semirings in Automata Theory (Extended Abstract), Logics for Weighted Timed Pushdown Automata, A Note on Decidable Separability by Piecewise Testable Languages, Monadic second order definable relations on the binary tree, Ogden's lemma for nonterminal bounded languages, Automata Presenting Structures: A Survey of the Finite String Case, Weighted simple reset pushdown automata, Decomposition and factorization of chemical reaction transducers, Reducing Acyclic Cover Transducers, On the rational subsets of the monogenic free inverse monoid, A Nivat theorem for weighted picture automata and weighted MSO logics, Langages algébriques déterministes non générateurs, On the continuity set of an Omega rational function, Efficiency of automata in semi-commutation verification techniques, Input- or output-unary sweeping transducers are weaker than their 2-way counterparts, On the average complexity of partial derivative transducers, Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups, A Hierarchy of Automaticω-Words having a Decidable MSO Theory, Word-mappings of level 2, On the Decidability of the Equivalence for k-Valued Transducers, An algebraic characterization of semirings for which the support of every recognizable series is recognizable, Context-sensitive languages and G-automata, Degree of Sequentiality of Weighted Automata, Incompleteness Theorems, Large Cardinals, and Automata over Finite Words, Polycyclic and Bicyclic Valence Automata, Extensional Uniformity for Boolean Circuits, On the Reachability Analysis of Acyclic Networks of Pushdown Systems, A Lower Bound For Reversible Automata, Unnamed Item, Linear automata with translucent letters and linear context-free trace languages, Computing the prefix of an automaton, Dynamics of implicit operations and tameness of pseudovarieties of groups, Unnamed Item, Two-letter group codes that preserve aperiodicity of inverse finite automata., Unnamed Item, New operations and regular expressions for two-dimensional languages over one-letter alphabet, A topological approach to transductions, Inference of finite-state transducers from regular languages, Pushdown tree automata, On the structure of the counting function of sparse context-free languages., Computing by commuting., Sequential?, A Kleene theorem and model checking algorithms for existentially bounded communicating automata, 3-Way Composition of Weighted Finite-State Transducers, On the complexity of reasoning in Kleene algebra, Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data, Finite transducers for divisibility monoids, Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications, Rational Selecting Relations and Selectors, Formal Languages and Groups as Memory, A Kleene Theorem for Forest Languages, On Computational Properties of Template-Guided DNA Recombination, Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata, Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization, An Automata-Theoretical Characterization of Context-Free Trace Languages, Series which are both max-plus and min-plus rational are unambiguous, Unnamed Item, Highly Undecidable Problems For Infinite Computations, Unnamed Item, Both Ways Rational Functions, Automatic Termination, The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable, On the Decidability of the Equivalence for a Certain Class of Transducers, Unique Decipherability in the Monoid of Languages: An Application of Rational Relations, Rational Transformations and a Kleene Theorem for Power Series over Rational Monoids, Implementation of Code Properties via Transducers, Unnamed Item, Semi-discrete context-free languages†, CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store, On free inverse monoid languages, The existential theory of equations with rational constraints in free groups is PSPACE-complete, Verification of programs with half-duplex communication, Decomposing a $k$-valued transducer into $k$ unambiguous ones, Sublogarithmic ambiguity, Fuzzy context-free languages. II: Recognition and parsing algorithms, Decision problems among the main subfamilies of rational relations, Systolic trellis automatata †, Systolic trellis automatat†, Commutative images of rational languages and the Abelian kernel of a monoid, MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS, Algebraic and context-free subsets of subgroups, On first-order runtime enforcement of branching-time properties, On generalized conjugacy and some related problems, Weighted two-way transducers, On endomorphisms of the direct product of two free groups, On the Commutative Equivalence of Algebraic Formal Series and Languages, Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem, Weighted two-way transducers, Identities and transductions, An explicit algorithm for normal forms in small overlap monoids, Formal grammars for turn-bounded deterministic context-free languages, Foundations of graph path query languages. Course notes for the reasoning web summer school 2021, Existential Definability over the Subword Ordering, Synchronizing deterministic push-down automata can be really hard, Synthesizing Computable Functions from Rational Specifications Over Infinite Words, A survey on automata with translucent letters, Locally finite languages, Reversible pushdown transducers, Learners based on transducers, Topological properties of omega context-free languages, Wadge hierarchy of omega context-free languages, On computational complexity of set automata, Transducing reversibly with finite state machines, Transducing reversibly with finite state machines, Regular Realizability Problems and Context-Free Languages, On implementing recognizable transductions, A Pattern Logic for Automata with Outputs, From Two-Way Transducers to Regular Function Expressions, Iterative pairs and multitape automata, Sur la structure des langages algébriques, On-line finite automata for addition in some numeration systems, Transductions and the parallel generation of languages†, The Subtrace Order and Counting First-Order Logic, On rationally controlled one-rule insertion systems, When is a functional tree transduction deterministic?, Polynomial closure of group languages and open sets of the Hall topology, On a subclass of context-free groups, On the termination problem for one-rule semi-Thue system, General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond, Representations of numbers and finite automata, The equivalence of pre-NTS grammars is decidable, Distance desert automata and the star height problem, Free group languages: Rational versus recognizable, On the Topological Complexity of Infinitary Rational Relations, Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations, Rational, recognizable, and aperiodic partially lossy queue languages, Unnamed Item, GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM, Actions, finite state sets and applications to trees, Compositional representation of rational functions, Rational transductions and complexity of counting problems, Numeration systems, linear recurrences, and regular sets, Linear numeration systems, θ-developments and finite automata, On the equivalence problem for deterministic multitape automata and transducers, Semi-trace morphisms and rational transductions, Unnamed Item, Logical definability of some rational trace languages, Rational transductions and complexity of counting problems, Confluence up to Garbage, On coding morphisms for zigzag codes, Abelian Invertible Automata, Unnamed Item, A new normal form for the compositions of morphisms and inverse morphisms, Coordinated pair systems ; part I : Dyck works and classical pumping, Unnamed Item, Unnamed Item, Eraser morphisms and membership problem in groups and monoids, Unnamed Item, Unnamed Item, A note on the iteration of infinite matrices, Fair expressions and regular languages over lists, On lindenmayerian rational subsets of monoids, Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words, Unnamed Item, Bisections reconnaissables, Quotient and bounded context-free languages, The monoids of the patience sorting algorithm, On some transducer equivalence problems for families of languages, S-adic Sequences: A Bridge Between Dynamics, Arithmetic, and Geometry, Monoïde libre et musique : deuxième partie, Unboundedness Problems for Languages of Vector Addition Systems., Resynchronizing Classes of Word Relations, Decidability of equivalence for a class of non-deterministic tree transducers, Le p-pliage de papier, Consensus Game Acceptors and Iterated Transductions, Multi-Sequential Word Relations, Strongly automatic semigroups, The algebraic equivalent of AFL theory, Concatenation of graphs, Security Policies Enforcement Using Finite Edit Automata, Decidability of code properties, On Shuffle Ideals, Monoid kernels and profinite topologies on the free Abelian group, Radix enumeration of rational languages, Some decision problems on integer matrices, Unnamed Item, Unnamed Item, Sequential monotonicity for restarting automata, Unnamed Item, An Automata Theoretic Approach to Rational Tree Relations, A Greibach normal form for context-free graph grammars, Asynchronous cellular automata for infinite traces, Unnamed Item, Unnamed Item, Unnamed Item, Graph Logics with Rational Relations, The equivalence problem for languages defined by transductions on D0L languages, Unnamed Item, Randomized generation of error control codes with automata and transducers, Non axiomatisability of positive relation algebras with constants, via graph homomorphisms, Closure properties of synchronized relations, A Formal Framework for Complex Event Processing, Origin-equivalence of two-way word transducers is in PSPACE, The Quantifier Alternation Hierarchy of Synchronous Relations, Reachability via Cooperating Morphisms, ON SOME PROPERTIES OF THE LANGUAGE OF 2-COLLAPSING WORDS, A remark about a substitution property, Unnamed Item, Unnamed Item, Every commutative quasirational language is regular, Outils et résultats pour les transducteurs boustrophédons, Characterizations of the decidability of some problems for regular trace languages, Comparisons between some pumping conditions for context-free languages, Cardinality problems of compositions of morphisms and inverse morphisms, Unnamed Item, Unambiguity in Automata Theory, Derivation languages of grammar forms†, A note on non-generators of full afl's, Asynchronous sliding block maps
