Formal languages defined by uniform substitutions
type: Item
instance of: scholarly article
title: Formal languages defined by uniform substitutions
zbMATH Open document ID: 0821.68073
DOI: 10.1016/0304-3975(94)90235-6
author: J.-C. Birget
author: Joseph B. Stephen
published in: Theoretical Computer Science
publication date: 1994-09-25T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 643676
zbMATH Keywords: uniform substitution
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)90235-6
OpenAlex ID: W2073227723
cites work: Q3886890
cites work: Q3859267
cites work: Two-way automata and length-preserving homomorphisms
cites work: Q4079524
cites work: Q4198075
cites work: Q3862379
cites work: Q4140407
cites work: Contractive presentations: A family of inverse monoids and semigroups with finite \({\mathcal R}\)-classes
Recommended article: Q3339307
Recommended article: Q5367067
Recommended article: Formal Languages, Formally and Coinductively
Recommended article: Q4404453
Recommended article: The theory of formal languages
Recommended article: Q4242582
Recommended article: Q4501671
Recommended article: Formalising Generalised Substitutions
Recommended article: Many aspects of formal languages
Recommended article: Formal languages and compilation
description: scientific article; zbMATH DE number 643676