Decidability of the equivalence problem for finitely ambiguous finance automata

Kosaburo Hashiguchi, Kenichi Ishiguro, Shuji Jinbo

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

A finance automaton is a sixtuple 〈Σ, Q, δ, S, F, f〉, where 〈Σ, Q, δ, S, F〉 is a (non-deterministic) finite automaton, f : Q × Σ × Q → R ∪ {- ∞} is a finance function, R is the set of real numbers and f(q, a, q′) = -∞ if and only if q′ ∉ δ(q, a). The function f is extended to f : 2Q × Σ* × 2Q → R ∪ {- ∞} by the plus-max principle. For any ω ∈ Σ*, f(S, ω, F) is the profit of ω. It is shown that the equivalence problem for finitely ambiguous finance automata is decidable.

Original languageEnglish
Pages (from-to)445-461
Number of pages17
JournalInternational Journal of Algebra and Computation
Volume12
Issue number3
DOIs
Publication statusPublished - 2002

    Fingerprint

Keywords

  • Finance automata
  • Plus-max principle
  • Transducer
  • Tropical semiring

ASJC Scopus subject areas

  • Mathematics(all)

Cite this