Substitution in families of languages

DOI10.1016/S0020-0255(70)80044-5zbMath0211.31401OpenAlexW2064836581MaRDI QIDQ2544191

Seymour Ginsburg, Edwin H. Spanier

Publication date: 1970

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(70)80044-5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (16)

Chains of full AFL's ⋮ MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS ⋮ A model for ergodic automorphisms on groups ⋮ Context free closed families of languages ⋮ On some families of languages related to developmental systems ⋮ Parallel OL-languages ⋮ On incomparable abstract family of languages (AFL) ⋮ Two-way A-transducers and AFL ⋮ Some independent families of one-letter languages ⋮ Iterating iterated substitution ⋮ Principal AFL ⋮ Syntactic operators on full semiAFLs ⋮ AFL with the semilinear property ⋮ Theory of formal grammars ⋮ Fuzzy context-free languages. I: Generalized fuzzy context-free grammars ⋮ Algebraic aspects of families of fuzzy languages

Cites Work

• Derivation-bounded languages
• AFL with the semilinear property
• Operations Which Preserve Definability in Languages
• Studies in abstract families of languages
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Substitution in families of languages