On the equivalence of some transductions involving letter to letter morphisms on regular languages

Transductions and Context-Free Languages

Jean Berstel · 1979 · 1.3K citations

Computing, Computer Science, Mathematics +8

Introduction to formal language theory

Computer Languages · 1980 · 1.3K citations

Computing, Computer Science, Formal Methods +11

The Mathematical Theory of L Systems

Grzegorz Rozenberg, Arto Salomaa · DAIMI Report Series · 1974 · 827 citations · Full text

Computing, Information Systems, Mathematics +7

The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines

T. V. Griffiths · Journal of the ACM · 1968 · 154 citations · Full text

Computing, Computer Science, Algorithms +11

The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications

Óscar H. Ibarra · SIAM Journal on Computing · 1978 · 72 citations

Computing, Computer Science, Mathematics +13