Formal languages defined by uniform substitutions

DOI10.1016/0304-3975(94)90235-6zbMath0821.68073OpenAlexW2073227723MaRDI QIDQ1334665

Joseph B. Stephen, Jean-Camille Birget

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)

Related Items (2)

Extending regular expressions with homomorphic replacement ⋮ Amalgamated free products of inverse semigroups

Cites Work

• Contractive presentations: A family of inverse monoids and semigroups with finite \({\mathcal R}\)-classes
• Two-way automata and length-preserving homomorphisms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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