On the Characterization of Certain Classes of Developmental Languages by Automata

S. H. Von Solms

doi:10.1080/00207167508803106

On the Characterization of Certain Classes of Developmental Languages by Automata

S. H. Von Solms

Academy of Computer Science and Software Engineering

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	125-132
Number of pages	8
Journal	International Journal of Computer Mathematics
Volume	5
Issue number	1-4
DOIs	https://doi.org/10.1080/00207167508803106
Publication status	Published - Jan 1975

ASJC Scopus subject areas

Computer Science Applications
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.1080/00207167508803106

Cite this

@article{237e5fb2e172469aa3f1498ad49caa94,

title = "On the Characterization of Certain Classes of Developmental Languages by Automata",

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.",

author = "\{Von Solms\}, \{S. H.\}",

year = "1975",

month = jan,

doi = "10.1080/00207167508803106",

language = "English",

volume = "5",

pages = "125--132",

journal = "International Journal of Computer Mathematics",

issn = "0020-7160",

publisher = "Taylor and Francis Ltd.",

number = "1-4",

}

TY - JOUR

T1 - On the Characterization of Certain Classes of Developmental Languages by Automata

AU - Von Solms, S. H.

PY - 1975/1

Y1 - 1975/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0016624430

U2 - 10.1080/00207167508803106

DO - 10.1080/00207167508803106

M3 - Article

AN - SCOPUS:0016624430

SN - 0020-7160

VL - 5

SP - 125

EP - 132

JO - International Journal of Computer Mathematics

JF - International Journal of Computer Mathematics

IS - 1-4

ER -

On the Characterization of Certain Classes of Developmental Languages by Automata

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this