• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Federated Conference on Computer Science and Information Systems >A new algorithm for the determinisation of visibly pushdown automata
【24h】

A new algorithm for the determinisation of visibly pushdown automata

机译：确定可见下推自动机的新算法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Visibly pushdown automata are pushdown automata whose pushdown operations are determined by the input symbol, where the input alphabet is partitioned into three parts for push, pop and local pushdown operations. It is well known that nondeterministic visibly pushdown automata can be determinised. In this paper a new algorithm for the determinisation of nondeterministic visibly pushdown automata is presented. The algorithm improves the existing methods and can result in significantly smaller deterministic pushdown automata. This is achieved in a way that only necessary and accessible states and pushdown symbols are computed and constructed during the determinisation.
机译：可视下推自动机是下推自动机，其下推操作由输入符号确定，其中输入字母分为三部分，分别用于下推，弹出和本地下推操作。众所周知，可以确定非确定性的下推自动机。在本文中，提出了一种用于确定性不确定的可视下推自动机的新算法。该算法对现有方法进行了改进，并且可以导致确定性下推自动机的数量大大减少。这是通过在确定过程中仅计算和构造必要且可访问的状态和下推符号的方式来实现的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号