Diagrams (e.g., trees for hierarchical structures, or graphs for finite state machines) are often needed as part of advanced user interfaces, and are frequently specific to a use...
Evolutionary programming was first offered as an alternative method for generating artificial intelligence. Experiments were offered in which finite state machines were used to...
Lawrence J. Fogel, Peter J. Angeline, David B. Fog...
CAST.FSM denotes a CAST tool which has been developed at the Institute of Systems Science at the University of Linz during the years 1986-1993. The first version of CAST.FSM was i...
Michael Affenzeller, Franz Pichler, Rudolf Mittelm...
Finite state transducers (FSTs) are finite state machines that map strings in a source domain into strings in a target domain. While there are many reports in the literature of ev...
CHOPRA, AMIT KHUSHWANT. Nonmonotonic Commitment Machines. (Under the direction of Dr. Munindar P. Singh). Protocols in open and dynamic multiagent systems cannot be modeled via fo...
Abstract. Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of th...
We present a novel approach for verifying safety properties of finite state machines communicating over unbounded FIFO channels that is based on applying machine learning techniqu...
Abhay Vardhan, Koushik Sen, Mahesh Viswanathan, Gu...