Yuki Nishida 0002

dblp:36/10522-2 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
5since 2021 · last 2026
0000-0002-7345-1334ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 3 first-author · 4 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2026 Characterization and algorithm for max-plus supereigenvector problem by parametric programming
Yuki Nishida 0002, Sennosuke Watanabe, Yoshihide Watanabe
Discret. Appl. Math.1
2026 Convergence of q-state vector-valued fuzzy cellular automata with weighted-averaging rules
abstract
Fuzzy cellular automata are dynamical systems that are continuous counterparts of the usual cellular automata (CA). Compared with the binary case, defining a fuzzy CA with three or more states is challenging because defining mixed states is difficult. Recently, this difficulty was resolved by representing multiple states as independent vectors in higher dimensions, and the concept of vector-valued fuzzy CA (VFCA) was introduced. In this study, we theoretically analyze and discuss the asymptotic behavior of three-neighbor VFCA. First, we define the weighted-averaging rules of VFCA and show how many rules exist up to the equivalence relations. According to these rules, each state vector in the next step is determined by the weighted average of the vectors in its neighboring cells. Next, we prove that three-state VFCA with weighted-averaging rules converge to a periodic configuration characterized by the symmetric group of order 3. In particular, the non-commutativity of the group action provides an interesting behavior that is not observed in fuzzy CA arising from binary states. Finally, we extend the results to VFCA with more than three states.
Yuki Nishida 0002, Koki Yamasaki, Sennosuke Watanabe, Akiko Fukuda, Yoshihide Watanabe
Nat. Comput.1
2025 Algorithm for the CSR Expansion of Max-Plus Matrices Using the Characteristic Polynomial
abstract
Abstract. Max-plus algebra is a semiring with addition [Formula: see text] and multiplication [Formula: see text]. It is applied in cases such as combinatorial optimization and discrete event systems. We consider the power of max-plus square matrices, which is equivalent to obtaining the all-pair maximum weight paths with a fixed length in the corresponding weighted digraph. Each [Formula: see text]-by-[Formula: see text] matrix admits the CSR expansion that decomposes the matrix into a sum of at most [Formula: see text] periodic terms after [Formula: see text] times of powers. In this study, we propose an [Formula: see text] time algorithm for the CSR expansion, where [Formula: see text] is the number of nonzero entries in the matrix, which improves the [Formula: see text] algorithm known for this problem. Our algorithm is based on finding the roots of the characteristic polynomial of the max-plus matrix. These roots play a similar role to the eigenvalues of the matrix and become the growth rates of the terms in the CSR expansion.
Yuki Nishida 0002
SIAM J. Discret. Math.1
2024 Max-plus Algebraic Description of Evolutions of Weighted Timed Event Graphs
Kensuke Kitai, Yuki Nishida 0002, Yoshihide Watanabe
Theory Comput. Syst.2
2021 Combinatorial algorithm for the computation of cyclically standard regular bracket monomials
Yuki Nishida 0002, Sennosuke Watanabe, Yoshihide Watanabe
J. Symb. Comput.1