当前位置: X-MOL 学术arXiv.cs.FL › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Minimization of visibly pushdown automata is NP-complete
arXiv - CS - Formal Languages and Automata Theory Pub Date : 2019-07-22 , DOI: arxiv-1907.09563
Olivier Gauwin, Anca Muscholl and Michael Raskin

We show that the minimization of visibly pushdown automata is NP-complete. This result is obtained by introducing immersions, that recognize multiple languages (over a usual, non-visible alphabet) using a common deterministic transition graph, such that each language is associated with an initial state and a set of final states. We show that minimizing immersions is NP-complete, and reduce this problem to the minimization of visibly pushdown automata.

中文翻译:

可见下推自动机的最小化是 NP 完全的

我们表明,可见下推自动机的最小化是 NP 完全的。这个结果是通过引入沉浸式获得的,沉浸式使用通用的确定性转换图识别多种语言(在通常的、不可见的字母表上),这样每种语言都与一个初始状态和一组最终状态相关联。我们表明最小化沉浸是 NP 完全的,并将这个问题减少到最小化可见下推自动机。
更新日期:2020-06-17
down
wechat
bug