|
|||||
|
|
On a family of acceptors for some classes of developmental languages |
|
| 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. |
| Keywords: | Grammars Acceptors Developmental Systems and Languages Parsing |