Scholarlink

We study semilattices containing covering automata for the Waterloo automaton, which plays an important role in algorithms of the vertex minimization of nondeterministic finite automata. We give a complete description of the obtained semilattices from the point of view of equivalence of the covering automata included in them to the Waterloo automaton. Three classes of semilattices are considered, several variants of representation for each class are constructed.

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

On the Representation of Classes of Semilattices on the Set of Covering Automata for the Waterloo Automaton

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Mikhail Abramyan

摘要

We study semilattices containing covering automata for the Waterloo automaton, which plays an important role in algorithms of the vertex minimization of nondeterministic finite automata. We give a complete description of the obtained semilattices from the point of view of equivalence of the covering automata included in them to the Waterloo automaton. Three classes of semilattices are considered, several variants of representation for each class are constructed.