On a family of acceptors for some classes of developmental languages

Author:

Abstract
A machine model, which consists essentially of a finite state control and an array of counters with first-in-last-out access, is formulated and it is proved that, under certain restrictions, the class of languages accepted is identical to the class of developmental languages without interactions.

This publication has 11 references indexed in Scilit: