Scholarlink

Here we study the descriptional complexity of several types of restarting automata. First, we investigate this topic for some types of restarting automata that characterize the class of regular languages. In Section 3.1, nondeterministic R-automata and deterministic RR-automata with window size one are considered.

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

Descriptional Complexity

  • 章节

  • 发表日期：

    2025年

查看全文
  • Friedrich Otto

摘要

Here we study the descriptional complexity of several types of restarting automata. First, we investigate this topic for some types of restarting automata that characterize the class of regular languages. In Section 3.1, nondeterministic R-automata and deterministic RR-automata with window size one are considered.