On the Characterization of Certain Classes of Developmental Languages by Automata

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)125-132
Number of pages8
JournalInternational Journal of Computer Mathematics
Volume5
Issue number1-4
DOIs
Publication statusPublished - Jan 1975

ASJC Scopus subject areas

  • Computer Science Applications
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'On the Characterization of Certain Classes of Developmental Languages by Automata'. Together they form a unique fingerprint.

Cite this