Determinizing K-Path Input-Driven PDAs

Mohammad Zakzok,Kai Salomaa

Lecture Notes in Computer Science（2026）

Queen’s University

被引用0|浏览0

摘要

A k-path nondeterministic input-driven pushdown automaton (NIDPDA) has at most k computation paths on any input. We present an improved determinization construction for k-path NIDPDAs and a lower bound for the size blow-up of determinization that is significantly better than the previous lower bounds.

更多

查看译文

关键词

input-driven pushdown automata,limited nondeterminism,determinization,size complexity,lower bounds

上传PDF