Abstract
A new family of automata, called orderless contraction automata of complexity (0, ∞), is introduced, and it is proved that this family of automata accepts precisely the class of propagating, normal, limited, extended, tabled 0-Lindenmayer languages (Rosenberg [4], Herman [2]). Furthermore a subfamily of this new family of automata accepts precisely the class of propagating, normal, limited, extended 0-Lindenmayer languages.
Original language | English |
---|---|
Pages (from-to) | 125-132 |
Number of pages | 8 |
Journal | International Journal of Computer Mathematics |
Volume | 5 |
Issue number | 1-4 |
DOIs | |
Publication status | Published - Jan 1975 |
ASJC Scopus subject areas
- Computer Science Applications
- Computational Theory and Mathematics
- Applied Mathematics