Let G be a connected complex reductive algebraic groups. The dual group ~LG^0 of G is an algebraic group whose simple root system π~v is the dual of the simple root system π of G and whose characteristic lattice is ...Let G be a connected complex reductive algebraic groups. The dual group ~LG^0 of G is an algebraic group whose simple root system π~v is the dual of the simple root system π of G and whose characteristic lattice is just the dual lattice X_*(T) of the characteristic lattice X~*(T)of G, where T is a given maximal torus of G and the simple root system π corresponds to a Borel subgroup B containing T. For the detail of the definition of a dual group see Ref. [1].展开更多
A ring R is called orthogonal if for any two idempotents e and f in R, the condition that e and f are orthogonal in R implies the condition that [eR] and [fR] are orthogonal in K0(R)+, i.e., [eR]∧[fR] = 0. In this pa...A ring R is called orthogonal if for any two idempotents e and f in R, the condition that e and f are orthogonal in R implies the condition that [eR] and [fR] are orthogonal in K0(R)+, i.e., [eR]∧[fR] = 0. In this paper, we shall prove that the K0-group of every orthogonal, IBN2 exchange ring is always torsion-free, which generalizes the main result in [3].展开更多
Traditional matrix-based approaches in the field of finite state machines construct state transition matrices,and then use the powers of the state transition matrices to represent corresponding dynamic transition proc...Traditional matrix-based approaches in the field of finite state machines construct state transition matrices,and then use the powers of the state transition matrices to represent corresponding dynamic transition processes,which are cornerstones of system analysis.In this study,we propose a static matrix-based approach that revisits a finite state machine from its structure rather than its dynamic transition process,thus avoiding the“explosion of complexity”problem inherent in the existing approaches.Based on the static approach,we reexamine the issues of closed-loop detection and controllability for deterministic finite state machines.In addition,we propose controllable equivalent form and minimal controllable equivalent form concepts and give corresponding algorithms.展开更多
Motivated by the inconvenience or even inability to explain the mathematics of the state space optimization of finite state machines(FSMs)in most existing results,we consider the problem by viewing FSMs as logical dyn...Motivated by the inconvenience or even inability to explain the mathematics of the state space optimization of finite state machines(FSMs)in most existing results,we consider the problem by viewing FSMs as logical dynamic systems.Borrowing ideas from the concept of equilibrium points of dynamic systems in control theory,the concepts of t-equivalent states and t-source equivalent states are introduced.Based on the state transition dynamic equations of FSMs proposed in recent years,several mathematical formulations of t-equivalent states and t-source equivalent states are proposed.These can be analogized to the necessary and sufficient conditions of equilibrium points of dynamic systems in control theory and thus give a mathematical explanation of the optimization problem.Using these mathematical formulations,two methods are designed to find all the t-equivalent states and t-source equivalent states of FSMs.Further,two ways of reducing the state space of FSMs are found.These can be implemented without computers but with only pen and paper in a mathematical manner.In addition,an open question is raised which can further improve these methods into unattended ones.Finally,the correctness and effectiveness of the proposed methods are verified by a practical language model.展开更多
基金Project supported in part by the National Natural Science Foundation of China and K. C. Wong Education Foundation.
文摘Let G be a connected complex reductive algebraic groups. The dual group ~LG^0 of G is an algebraic group whose simple root system π~v is the dual of the simple root system π of G and whose characteristic lattice is just the dual lattice X_*(T) of the characteristic lattice X~*(T)of G, where T is a given maximal torus of G and the simple root system π corresponds to a Borel subgroup B containing T. For the detail of the definition of a dual group see Ref. [1].
基金the National Natural Science Foundation of China （No. 10571080） the Natural Science Foundation of Jiangxi Province （No. 0611042） the Science and Technology Projiet Foundation of Jiangxi Province （No. G[20061194） and the Doctor Foundation of Jiangxi University of Science and Technology.
文摘A ring R is called orthogonal if for any two idempotents e and f in R, the condition that e and f are orthogonal in R implies the condition that [eR] and [fR] are orthogonal in K0(R)+, i.e., [eR]∧[fR] = 0. In this paper, we shall prove that the K0-group of every orthogonal, IBN2 exchange ring is always torsion-free, which generalizes the main result in [3].
基金supported by the National Natural Science Foundation of China(Nos.U1804150,62073124,and 61973175)。
文摘Traditional matrix-based approaches in the field of finite state machines construct state transition matrices,and then use the powers of the state transition matrices to represent corresponding dynamic transition processes,which are cornerstones of system analysis.In this study,we propose a static matrix-based approach that revisits a finite state machine from its structure rather than its dynamic transition process,thus avoiding the“explosion of complexity”problem inherent in the existing approaches.Based on the static approach,we reexamine the issues of closed-loop detection and controllability for deterministic finite state machines.In addition,we propose controllable equivalent form and minimal controllable equivalent form concepts and give corresponding algorithms.
基金Project supported by the National Natural Science Foundation of China(Nos.U1804150,62073124,and 61973175)。
文摘Motivated by the inconvenience or even inability to explain the mathematics of the state space optimization of finite state machines(FSMs)in most existing results,we consider the problem by viewing FSMs as logical dynamic systems.Borrowing ideas from the concept of equilibrium points of dynamic systems in control theory,the concepts of t-equivalent states and t-source equivalent states are introduced.Based on the state transition dynamic equations of FSMs proposed in recent years,several mathematical formulations of t-equivalent states and t-source equivalent states are proposed.These can be analogized to the necessary and sufficient conditions of equilibrium points of dynamic systems in control theory and thus give a mathematical explanation of the optimization problem.Using these mathematical formulations,two methods are designed to find all the t-equivalent states and t-source equivalent states of FSMs.Further,two ways of reducing the state space of FSMs are found.These can be implemented without computers but with only pen and paper in a mathematical manner.In addition,an open question is raised which can further improve these methods into unattended ones.Finally,the correctness and effectiveness of the proposed methods are verified by a practical language model.
