Elementary homomorphisms and a solution of the D0L sequence equivalence problem
- 31 December 1978
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 7 (2), 169-183
- https://doi.org/10.1016/0304-3975(78)90047-6
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Book Review: Automata-theoretic aspects of formal power seriesBulletin of the American Mathematical Society, 1979
- Simplifications of homomorphismsInformation and Control, 1978
- The decidability of the equivalence problem for DOL-systemsInformation and Control, 1977
- The Mathematical Theory of L SystemsPublished by Springer Nature ,1976
- Subword complexities of various classes of deterministic developmental languages without interactionsTheoretical Computer Science, 1975
- On the Decidability of some Equivalence Problems for D0L-SystemsDAIMI Report Series, 1973