EWHCI
1995
13 years 8 months ago
1995
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...
EPS
1995
Springer
13 years 8 months ago
1995
Springer
Evolutionary programming was first offered as an alternative method for generating artificial intelligence. Experiments were offered in which finite state machines were used to...
EUROCAST
2001
Springer
13 years 9 months ago
2001
Springer
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...
EUROGP
2003
Springer
13 years 9 months ago
2003
Springer
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...
AGENTCL
2003
Springer
13 years 9 months ago
2003
Springer
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...
ICGI
2004
Springer
13 years 10 months ago
2004
Springer
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...
ICFEM
2004
Springer
13 years 10 months ago
2004
Springer
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...