DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA

DOI10.1142/S0218196702000845zbMath1007.68115OpenAlexW2002014927WikidataQ129445339 ScholiaQ129445339MaRDI QIDQ4786328

Kosaburo Hashiguchi, Kenichi Ishiguro, Shuji Jimbo

Publication date: 15 December 2002

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196702000845

zbMATH Keywords

finance automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (16)

DETERMINATIONS OF WEIGHTED FINITE AUTOMATA OVER COMMUTATIVE IDEMPOTENT MF-SEMIRINGS ⋮ Weight Assignment Logic ⋮ Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata ⋮ A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata ⋮ Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton ⋮ Sequential? ⋮ Component simulation-based substitutivity managing QoS and composition issues ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Series which are both max-plus and min-plus rational are unambiguous ⋮ Unnamed Item ⋮ Finite sequentiality of unambiguous max-plus tree automata ⋮ On Finite and Polynomial Ambiguity of Weighted Tree Automata ⋮ What's decidable about weighted automata? ⋮ How to Tackle Integer Weighted Automata Positivity ⋮ Max-plus automata

Cites Work

• Limitedness theorem on finite automata with distance functions
• Representation theorems on regular languages
• Algorithms for determining relative star height and star height
• Algorithms for determining relative inclusion star height and inclusion star height
• Rational relations and rational series
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE

This page was built for publication: DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA