几类带空转移的n元伪加权自动机的关系

引入了n元伪加权有穷自动机——带有n个有限字符集的伪加权有穷自动机、分明型n元伪加权有穷自动机和确定型n元伪加权有穷自动机的概念。根据状态转移函数在每个字符集上是否带空转移, 将以上自动机分为4类:带r-型空转移的n元伪加权有穷自动机和带空转移的n元伪加权有穷自动机和带r-型空转移的分明型n元伪加权有穷自动机和带空转移的分明型n元伪加权有穷自动机。给出了以上自动机所识别语言的定义并探究了它们之间的关系,讨论了状态转移函数在每个字符集上是否带空转移对其接受语言的影响。

Relationships among several types of n-ary pseudo weighted automata with empty moves

The notions of n-ary pseudo weighted finite automata (i.e., pseudo weighted finite auto- mata with n nonempty finite sets of symbols), crisp n-ary pseudo weighted finite automata, and deterministic n-ary pseudo weighted finite automata are introduced. According to the transition function with empty moves or not on each finite set of symbols, the above automata are classified into four forms: n-ary pseudo weighted finite automata with r-type empty moves, n-ary pseudo weighted finite automata with empty moves, crisp n-ary pseudo weighted finite automata with r-type empty moves, and crisp n-ary pseudo weighted finite automata with empty moves. The languages accepted by the above automata and the relationships among them are studied, and the influence of the transition function with empty moves or not on each finite set of symbols is discussed.