Languages with homomorphic replacements

DOI10.1016/0304-3975(81)90100-6zbMath0468.68085OpenAlexW2020039713WikidataQ123190124 ScholiaQ123190124MaRDI QIDQ1156494

S. H. Smith

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(81)90100-6

zbMATH Keywords

generative powerH-systems as language generators

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Characterising REGEX languages by regular languages equipped with factor-referencing ⋮ Extended regular expressions: succinctness and decidability ⋮ Expressiveness and static analysis of extended conjunctive regular path queries ⋮ Pattern systems ⋮ Multi-pattern languages ⋮ Unnamed Item ⋮ INSIDE THE CLASS OF REGEX LANGUAGES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Copying theorems
• A relationship between ETOL and EDTOL languages
• Iterated deterministic-substitution
• IO and OI. I
• Decomposition Theorems for Various Kinds of Languages Parallel in Nature
• Some restrictions onW-grammars

This page was built for publication: Languages with homomorphic replacements