Forgetting automata and contex-free languages (Q1901701)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Forgetting automata and contex-free languages |
scientific article; zbMATH DE number 814154
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Forgetting automata and contex-free languages |
scientific article; zbMATH DE number 814154 |
Statements
Forgetting automata and contex-free languages (English)
0 references
19 November 1995
0 references
It is shown that context-free languages can be characterized by linear bounded automata with the following restriction: the head can either move right without rewriting or move left with erasing the current cell (i.e. rewriting it with a special, nonrewriteable, symbol). If, instead of erasing, we consider deleting (complete removing of the cell), the corresponding automata are less powerful.
0 references
context-free languages
0 references
linear bounded automata
0 references
