Scholarlink

It is shown that the problem whether there is a bound on the lengths of the words in the language accepted by an alternating one-window finite-memory automaton is decidable. The decision procedure relies on a kind of the pumping lemma for languages over infinite alphabets.

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

Bounded Languages Over Infinite Alphabets

  • 章节

  • 发表日期：

    2025年

查看全文
  • Yoav Danieli,
  • Michael Kaminski

摘要

It is shown that the problem whether there is a bound on the lengths of the words in the language accepted by an alternating one-window finite-memory automaton is decidable. The decision procedure relies on a kind of the pumping lemma for languages over infinite alphabets.