En Ru
Login
ISSN 0278-6419 (*printed)
ISSN 1934-8428 (electronic version)
ISSN 0278-6419 (*printed)
ISSN 1934-8428 (electronic version)
En Ru
Search
Tang T.

Tang T.

Tang T.
Shenzhen MSU-BIT University
E-mail: tangtx@smbu.edu.cn
Graduate student, Faculty of Computational Mathematics and Cybernetics, Shenzhen MSU-BIT University
  • Unification problem for finite state parameterized transducers
    Moscow University Journal. Series 15. Computational Mathematics and Cybernetics 2025. № 3. p. 74-84
    Tang T., Zakharov V.
    read more

    • 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 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

      Keywords: finite state machine, substitution, equivalence, unification problem