Languages with homomorphic replacements

DOI10.1016/0304-3975(81)90100-6MaRDI QIDQ1156494zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Cites work

• A relationship between ETOL and EDTOL languages
• Copying theorems
• Decomposition Theorems for Various Kinds of Languages Parallel in Nature
• scientific article; zbMATH DE number 3720386 (Why is no real title available?)
• scientific article; zbMATH DE number 3590511 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• IO and OI. I
• Iterated deterministic-substitution
• Some restrictions onW-grammars

Cited in

(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
• scientific article; zbMATH DE number 3776895 (Why is no real title available?)
• Inside the class of REGEX languages
• Pattern systems
• Multi-pattern languages

This page was built for publication: Languages with homomorphic replacements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1156494)