Efficient determinization of visibly and height-deterministic pushdown automata

New algorithms for the determinization of nondeterministic visibly and nondeterministic real-time height-deterministic pushdown automata are presented. The algorithms improve the results of existing algorithms. They construct only accessible states and necessary pushdown symbols of the resulting det...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer languages, systems & structures Jg. 46; S. 91 - 105
Hauptverfasser: Polách, Radomír, Trávníček, Jan, Janoušek, Jan, Melichar, Bořivoj
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Ltd 01.11.2016
Schlagworte:
ISSN:1477-8424, 1873-6866
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:New algorithms for the determinization of nondeterministic visibly and nondeterministic real-time height-deterministic pushdown automata are presented. The algorithms improve the results of existing algorithms. They construct only accessible states and necessary pushdown symbols of the resulting deterministic pushdown automata. •Tracking pushdown symbols which can appear on top of pushdown store for each state.•Generating pop (return) transition only for possible top pushdown symbols for each state.•Overall generating only accessible states and necessary pushdown store symbols.•Visibly pushdown automata determinization algorithm.•Height-deterministic (real-time) automata determinization algorithm.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1477-8424
1873-6866
DOI:10.1016/j.cl.2016.07.005