On the Complexity of Finite, Pushdown, and Stack Automata

On the Complexity of Finite, Pushdown, and Stack Automata

The complexity of predicates on the 1-way finite, pushdown, and stack automata languages is studied. Every nontrivial predicate on the 1-way stack languages is shown to require exponential time, when applied to the stack automata, indexed grammars, or OI-macro grammars. Every nontrivial predicate on...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Hunt,H B , III
Format: Report
Sprache:eng
Schlagworte:
Automata theory
Computational complexity
Computer Programming and Software
CONTEXT FREE GRAMMARS
CONTEXT SENSITIVE GRAMMARS
Finite automata
Formal languages
GRAMMARS
Linguistics
MATHEMATICAL LOGIC
PROGRAMMING LANGUAGES
Pushdown automata
RECURSIVE FUNCTIONS
Stack automata
THEOREMS
Theoretical Mathematics
Turing machines
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The complexity of predicates on the 1-way finite, pushdown, and stack automata languages is studied. Every nontrivial predicate on the 1-way stack languages is shown to require exponential time, when applied to the stack automata, indexed grammars, or OI-macro grammars. Every nontrivial predicate on the context-free languages requires as much time and space as any 2-way pushdown automaton language.