Regulated pushdown automata (Q2714410)
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: Regulated pushdown automata |
scientific article; zbMATH DE number 1604335
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Regulated pushdown automata |
scientific article; zbMATH DE number 1604335 |
Statements
13 June 2001
0 references
pushdown automata
0 references
regulated automata
0 references
Regulated pushdown automata (English)
0 references
As the use of grammar rules can be regulated by control languages, this paper suggests to regulate the use of rules of pushdown automata by control langauges. For regular control langauges, it is proven that this regulation has no effect on the power of pushdown automata. However the pushdown automata regulated by linear control langauges characterize the family of recursively enumerable languages. The results are established in terms of acceptance by final state, of acceptance by empty pushdown and of the combination of both.
0 references
