Scholarlink

This title’s chapter may seem paradoxical in the context of Chapter 5 where is was shown that deterministic Büchi automata are strictly weaker than nondeterministic ones. In particular, the language (a+b)*aω cannot be recognised by a DBA, cf. Thm. 5.24. Thus, there is no determinisation procedure for NBA, at least none that yields equivalent DBA.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Determinisation

  • 章节

  • 发表日期：

    2025年

查看全文
  • Martin Hofmann,
  • Martin Lange

摘要

This title’s chapter may seem paradoxical in the context of Chapter 5 where is was shown that deterministic Büchi automata are strictly weaker than nondeterministic ones. In particular, the language (a+b)*aω cannot be recognised by a DBA, cf. Thm. 5.24. Thus, there is no determinisation procedure for NBA, at least none that yields equivalent DBA.