DETERMINATIONS OF WEIGHTED FINITE AUTOMATA OVER COMMUTATIVE IDEMPOTENT MF-SEMIRINGS

DOI10.1142/S0218196712500208zbMath1250.68200OpenAlexW2023484340MaRDI QIDQ2888836

Zhixi Wang, Yong He, Gongcai Xin

Publication date: 4 June 2012

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

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

zbMATH Keywords

determinationmaximal factorizationg.c.d. conditionMF-semirings

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semifields (12K10) Semirings (16Y60)

Cites Work

• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
• Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
• The limitedness problem on distance automata: Hashiguchi's method revisited
• Semimodules and semirings admitting a maximal factorization
• DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA
• Unnamed Item
• Unnamed Item

This page was built for publication: DETERMINATIONS OF WEIGHTED FINITE AUTOMATA OVER COMMUTATIVE IDEMPOTENT MF-SEMIRINGS