Formal languages defined by uniform substitutions

DOI10.1016/0304-3975(94)90235-6MaRDI QIDQ1334665zbMATH OpenOpenAlexFDO

Authors J.-C. Birget, Joseph B. Stephen

Publication date 25 September 1994

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

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

zbMATH Keywords

uniform substitution

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 3872706
• scientific article; zbMATH DE number 6790165
• Formal Languages, Formally and Coinductively
• scientific article; zbMATH DE number 3438410
• The theory of formal languages
• scientific article; zbMATH DE number 1286040
• scientific article; zbMATH DE number 1500649
• Formalising Generalised Substitutions
• Many aspects of formal languages
• Formal languages and compilation

Cites work

• Contractive presentations: A family of inverse monoids and semigroups with finite \({\mathcal R}\)-classes
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3692678 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3569855 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• Two-way automata and length-preserving homomorphisms

Cited in

(4)

• Uniform substitution at one Fell swoop
• Extending regular expressions with homomorphic replacement
• scientific article; zbMATH DE number 3911728 (Why is no real title available?)
• Amalgamated free products of inverse semigroups

This page was built for publication: Formal languages defined by uniform substitutions

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