Studies in abstract families of languages
From MaRDI portal
Publication:5590062
DOI10.1090/memo/0087zbMath0194.31402OpenAlexW1983845295MaRDI QIDQ5590062
Seymour Ginsburg, Sheila A. Greibach, John E. Hopcrofts
Publication date: 1969
Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/memo/0087
Related Items (85)
Unnamed Item ⋮ Chains of full AFL's ⋮ Unnamed Item ⋮ Closure property of principal cones under substitution ⋮ On the usefulness of bifaithful rational cones ⋮ Familles de langages fermées par crochet ouvert ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Images of AFL under certain families of homomorphisms ⋮ Unnamed Item ⋮ On weak growing context-sensitive grammars ⋮ Multi-stack-counter languages ⋮ MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS ⋮ Unnamed Item ⋮ On the undecidability and descriptional complexity of synchronized regular expressions ⋮ Extension of tabled 0L-systems and languages ⋮ Selective substitution array grammars ⋮ The string merging problem ⋮ Unnamed Item ⋮ Bounded query machines: on NP( ) and NPQUERY( ) ⋮ On nonstochastic languages and homomorphic images of stochastic languages ⋮ Unnamed Item ⋮ On the structure of context-sensitive grammars ⋮ Unnamed Item ⋮ Extensional Uniformity for Boolean Circuits ⋮ On a language without star ⋮ Upper bounds on recognition of a hierarchy of non-context-free languages ⋮ Complexity in left-associative grammar ⋮ Abstract Families of Abstract Categorial Languages ⋮ Extended finite automata over groups ⋮ Non-prinicipalité du cylindre des langages à compteur ⋮ \(X\)-automata on \(\omega\)-words ⋮ On incomparable abstract family of languages (AFL) ⋮ Automatic correction of syntax-errors in programming languages ⋮ Two iteration theorems for some families of languages ⋮ Transductions de séries formelles ⋮ Two-way A-transducers and AFL ⋮ The decidability of a mapping problem for generalized sequential machines with final states ⋮ Sur une conjecture de S. Greibach ⋮ Some independent families of one-letter languages ⋮ Reversal-bounded multipushdown machines ⋮ The tape-complexity of context-independent developmental languages ⋮ Families of automata characterizing context-sensitive languages ⋮ Some properties of the class of \(L\) languages with interactions ⋮ Abstract families of relations ⋮ Context-free grammar forms ⋮ Bounded AFLs ⋮ Comparing language operations ⋮ Max-product grammars and languages ⋮ Characterization theorems on abstract families of transducers ⋮ Hypergrammars: An extension of macrogrammars ⋮ Degree-languages: A new concept of acceptance ⋮ Control sets on context-free grammar forms ⋮ Weighted automata with storage ⋮ One way finite visit automata ⋮ Produit dans le cône rationnel engendre par D ⋮ Single-valued a-transducers ⋮ A note on classes of complements and the LBA-problem ⋮ On growing context-sensitive languages ⋮ On two-way sequential transductions of full semi-AFL's ⋮ Opérations de cylindre et applications séquentielles gauches inverses ⋮ Remarks on blind and partially blind one-way multicounter machines ⋮ Générateurs algébriques et systèmes de paires iterantes ⋮ What makes some language theory problems undecidable ⋮ Principal AFL ⋮ On the existence of generators for certain AFL ⋮ Syntactic operators on full semiAFLs ⋮ Time- and tape-bounded Turing acceptors and AFLs ⋮ Substitution in families of languages ⋮ Principal abstract families of weighted tree languages ⋮ Abstract families of processors ⋮ A characterization of two-way deterministic classes of languages ⋮ Finite-turn checking automata ⋮ Substitution and bounded languages ⋮ Writing stack acceptors ⋮ Absolutely parallel grammars and two-way finite-state transducers ⋮ A homomorphic characterization of principal semi AFLs without using intersection with regular sets ⋮ Left-derivation bounded languages ⋮ On families of full trios containing counter machine languages ⋮ Theory of formal grammars ⋮ MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies ⋮ Control sets on grammars ⋮ On two families of forests ⋮ Algebraic aspects of families of fuzzy languages
This page was built for publication: Studies in abstract families of languages
