Principal AFL

DOI10.1016/S0022-0000(70)80016-2zbMath0198.03102OpenAlexW2912057089MaRDI QIDQ2540269

Seymour Ginsburg, Sheila A. Greibach

Publication date: 1970

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(70)80016-2

zbMATH Keywords

languages, automata, networks

Related Items (54)

Single-tape reset machines ⋮ Unnamed Item ⋮ Familles de langages fermées par crochet ouvert ⋮ The emptiness problem for valence automata over graph monoids ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Multi-stack-counter languages ⋮ Reset machines ⋮ MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS ⋮ Automates a file ⋮ A model for ergodic automorphisms on groups ⋮ Context free closed families of languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Independance forte de certaines opérations ⋮ On some families of languages related to developmental systems ⋮ Left transformation languages ⋮ Unnamed Item ⋮ Morphismes et bimorphismes d'arbres ⋮ Refining the hierarchy of blind multicounter languages and twist-closed trios. ⋮ On incomparable abstract family of languages (AFL) ⋮ Two iteration theorems for some families of languages ⋮ Two-way A-transducers and AFL ⋮ Reversal-bounded multipushdown machines ⋮ Familles de langages translatables et fermées par crochet ⋮ Abstract families of length-preserving processors ⋮ Abstract families of relations ⋮ Uniformly erasable AFL ⋮ Bounded AFLs ⋮ Comparing complexity classes ⋮ Characterization theorems on abstract families of transducers ⋮ Proving containment of bounded AFL ⋮ Some uniformly erasable families of languages ⋮ Computation sequence sets ⋮ Control sets on context-free grammar forms ⋮ Weighted automata with storage ⋮ Un théorème de Chomsky-Schützenberger pour les forets algébriques ⋮ One way finite visit automata ⋮ 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 ⋮ Abstract families of context-free grammars ⋮ On the existence of generators for certain AFL ⋮ Syntactic operators on full semiAFLs ⋮ Principal abstract families of weighted tree languages ⋮ Three theorems concerning principal AFLs ⋮ Substitution and bounded languages ⋮ AFL with the semilinear property ⋮ Writing stack acceptors ⋮ On AFL generators for finitely encoded AFA ⋮ Unnamed Item ⋮ Theory of formal grammars

Cites Work

• Unnamed Item
• Checking automata and one-way stack languages
• Substitution in families of languages
• On certain formal properties of grammars
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• Finite-Turn Pushdown Automata
• An Infinite Hierarchy of Context-Free Languages
• Nested Stack Automata
• Studies in abstract families of languages

This page was built for publication: Principal AFL