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...

Full description

Saved in:
Bibliographic Details
Published in:Computer languages, systems & structures Vol. 46; pp. 91 - 105
Main Authors: Polách, Radomír, Trávníček, Jan, Janoušek, Jan, Melichar, Bořivoj
Format: Journal Article
Language:English
Published: Elsevier Ltd 01.11.2016
Subjects:
Accessibility
Algorithms
Construction
Deterministic pushdown automata
Determinization
Height-deterministic pushdown automata
Languages
Pushdown automata
Real time
Symbols
Visibly pushdown automata
Visibly pushdown automata
Determinization
Pushdown automata
Deterministic pushdown automata
Height-deterministic pushdown automata
ISSN:1477-8424, 1873-6866
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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