Scholarlink

Abstract <p>The unification problem for parameterized finite state machines consists in finding for two given automata such values of their parameters that these automata will compute the same transduction relations. This paper presents a quadratic time algorithm for computing the most general unifiers of parameterized deterministic finite state machines. This algorithm is based on the Martelli–Montanari unification algorithm for terms and the equivalence checking algorithm for deterministic finite state machines.</p>

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

Unification Problem for Finite State Parameterized Transducers

  • 期刊论文

  • 发表日期：

    2025年9月3日

查看全文
  • Tianxiang Tang,
  • V. A. Zakharov

摘要

Abstract

The unification problem for parameterized finite state machines consists in finding for two given automata such values of their parameters that these automata will compute the same transduction relations. This paper presents a quadratic time algorithm for computing the most general unifiers of parameterized deterministic finite state machines. This algorithm is based on the Martelli–Montanari unification algorithm for terms and the equivalence checking algorithm for deterministic finite state machines.