The Experts below are selected from a list of 312 Experts worldwide ranked by ideXlab platform
Yi Zhong - One of the best experts on this subject based on the ideXlab platform.
-
Products and decomposition of probabilistic Finite Automata
Computer Engineering and Applications, 2020Co-Authors: Yi ZhongAbstract:This paper gives three different products of probabilistic Finite Automata and discuss their mutual relationship through homomorphism and week homomorphism,some algebraic properties of those products are investigated,and in [1] the foundation has given the decomposition of average probability Finite Automata,and proven average probability Finite Automata can be decomposed into a series connected product of a stochastic encoding source and some determination Finite Automata.
-
The Quotient and Homomorphism of Probabilistic Finite Automata
Chinese Journal of Engineering Mathematics, 2020Co-Authors: Yi ZhongAbstract:By using the effective partition of probability Finite Automata,the homomorphisms of probability Finite Automata and some related problems of the quotient probability Finite Automata are investigated. In the sense of the homomorphism or the isomorphism (weak isomorphism),the relations about the probability Finite Automata are studied. Moreover,the relations between their quotient probability Automata are established.
-
Result about Decomposition of Weakly Invertible Finite Automata
Journal of Guangxi Normal University, 2020Co-Authors: Yi ZhongAbstract:It is very important to investigate the decomposition of weakly invertible Finite Automata,since it could provide an approach to cryptanalyzing Finite Automata public-key cryptosystem(FAPKC).This paper deals with the problem about the decomposition of weakly invertible Finite Automata M with delay τ,and a sufficient and necessary condition is obtained,which means it can be decomposed into a weakly invertible Finite Automata with delay τ-k0 and a so-called k0-order delay unit,if and only if the k0-output weight of s is 1 for any state s in M.
-
Equivalence between fuzzy recognizers and Finite Automata
Computer Engineering and Applications, 2020Co-Authors: Yi ZhongAbstract:In this paper,the relationships of fuzzy recognizers and Finite Automata is discussed.When the same input alphabet is given,the conclusion is proved that given any fuzzy recognizer,inevitably there is a Finite Automata,the acceptable language of which is the same as the behavior of the fuzzy recognizer,and conversely,given any Finite Automata,there exists a fuzzy recognizer,the behavior of which is the same as the acceptable language of the Finite Automata.Thus,the equivalence between them is obtained.
-
SOME RESULTS ON COMPOSITION OF Finite Automata
Journal of Guangxi Normal University, 2020Co-Authors: Yi ZhongAbstract:In the construction of cryptosystem of a pair of keys and cryptosystem which is based on identifcation,the composition of Finite Automata becomes a basic means.The article studies the paper the relation about weakly invertibility,strict delay step,linearity and weakly inverse between two Finite Automata and their composition.
Yiguang Hong - One of the best experts on this subject based on the ideXlab platform.
-
Matrix approach to stabilizability of deterministic Finite Automata
2013 American Control Conference, 2013Co-Authors: Xiangru Xu, Yanqiong Zhang, Yiguang HongAbstract:This paper investigates the state feedback stabilizing problem of deterministic Finite Automata using a matrix approach. With the help of semi-tensor product, a matrix-based expression for Finite Automata is given, and the dynamics of Automata are expressed in the form of a discrete-time bilinear equation. After providing the notions of equilibrium and cycle stability, we give necessary and sufficient algebraic conditions for the stabilizability of deterministic Finite Automata for the two respective cases. Then, based on the matrix expression, we focus on a special case where the controlled state trajectories to the target equilibrium is minimal. All the state feedback controllers can be obtained by solving a matrix inequality. Examples are also given for illustration.
-
matrix expression and reachability analysis of Finite Automata
Journal of Control Theory and Applications, 2012Co-Authors: Xiangru Xu, Yiguang HongAbstract:In this paper, we propose a matrix-based approach for Finite Automata and then study the reachability conditions. Both the deterministic and nondeterministic Automata are expressed in matrix forms, and the necessary and sufficient conditions on reachability are given using semitensor product of matrices. Our results show that the matrix expression provides an effective computational way for the reachability analysis of Finite Automata.
Kingshuk Chatterjee - One of the best experts on this subject based on the ideXlab platform.
-
Watson–Crick quantum Finite Automata
Acta Informatica, 2020Co-Authors: Debayan Ganguly, Kingshuk ChatterjeeAbstract:One-way quantum Finite Automata are reversible in nature, which greatly reduces its accepting property. In fact, the set of languages accepted by one-way quantum Finite Automata is a proper subset of regular languages. In this paper, we replace the tape head of one-way quantum Finite Automata with DNA double strand and name the model Watson–Crick quantum Finite Automata. The non-injective complementarity relation of Watson–Crick Automata introduces non-determinism in the quantum model. We show that this introduction of non-determinism increases the computational power of one-way quantum Finite Automata significantly. Watson–Crick quantum Finite Automata can accept all regular languages and also accepts some languages which are not accepted by any multi-head deterministic Finite Automata. Exploiting the superposition property of quantum Finite Automata, we show that Watson–Crick quantum Finite Automata accept the language L = {ww|w ∈ {a, b}^*}.
-
Watson-Crick Quantum Finite Automata
arXiv: Formal Languages and Automata Theory, 2015Co-Authors: Kingshuk ChatterjeeAbstract:1-way quantum Finite Automata are deterministic and reversible in nature, which greatly reduces its accepting property. In fact the set of languages accepted by 1-way quantum Finite Automata is a proper subset of regular languages. In this paper we replace the tape head of 1-way quantum Finite Automata with DNA double strand and name the model Watson-Crick quantum Finite Automata. The non-injective complementarity relation of Watson-Crick Automata introduces non-determinism in the quantum model. We show that this introduction of non-determinism increases the computational power of 1-way Quantum Finite Automata significantly. We establish that Watson-Crick quantum Finite Automata can accept all regular languages and that it also accepts some languages not accepted by any multihead deterministic Finite Automata. Exploiting the superposition property of quantum Finite Automata we show that Watson-Crick quantum Finite Automata accept the language L=ww where w belongs to {a,b}*.
Xiangru Xu - One of the best experts on this subject based on the ideXlab platform.
-
Matrix approach to stabilizability of deterministic Finite Automata
2013 American Control Conference, 2013Co-Authors: Xiangru Xu, Yanqiong Zhang, Yiguang HongAbstract:This paper investigates the state feedback stabilizing problem of deterministic Finite Automata using a matrix approach. With the help of semi-tensor product, a matrix-based expression for Finite Automata is given, and the dynamics of Automata are expressed in the form of a discrete-time bilinear equation. After providing the notions of equilibrium and cycle stability, we give necessary and sufficient algebraic conditions for the stabilizability of deterministic Finite Automata for the two respective cases. Then, based on the matrix expression, we focus on a special case where the controlled state trajectories to the target equilibrium is minimal. All the state feedback controllers can be obtained by solving a matrix inequality. Examples are also given for illustration.
-
matrix expression and reachability analysis of Finite Automata
Journal of Control Theory and Applications, 2012Co-Authors: Xiangru Xu, Yiguang HongAbstract:In this paper, we propose a matrix-based approach for Finite Automata and then study the reachability conditions. Both the deterministic and nondeterministic Automata are expressed in matrix forms, and the necessary and sufficient conditions on reachability are given using semitensor product of matrices. Our results show that the matrix expression provides an effective computational way for the reachability analysis of Finite Automata.
Pavel Martinek - One of the best experts on this subject based on the ideXlab platform.
-
Some notes to minimization of multiset Finite Automata
2018Co-Authors: Pavel MartinekAbstract:The paper deals with minimization of multiset Finite Automata. It is shown that in case of deterministic multiset Finite Automata whose transitions satisfy certain conditions based on lexicographic ordering, the resulting minimal automaton is unique up to isomorphism. On the other hand, no such unique minimal automaton exists in case of nondeterministic multiset Finite Automata.
-
Fuzzy multiset Finite Automata: Determinism, languages, and pumping lemma
2015 12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD), 2015Co-Authors: Pavel MartinekAbstract:The concept of fuzzy multiset Finite Automata was introduced recently by Wang et al. in [14]. The idea is elaborated towards deterministic fuzzy multiset Finite Automata and the corresponding languages. The languages are studied with respect to some closure properties. Pumping lemmata are described for languages accepted by both non-deterministic and deterministic fuzzy multiset Finite Automata.
