936 search results - page 60 / 188 » FSM-Hume is finite state |
154
click to vote
ALT
2009
Springer
16 years 3 months ago
2009
Springer
We consider the problem of learning a finite automaton M of n states with input alphabet X and output alphabet Y when a teacher has helpfully or randomly labeled the states of M u...
195
click to vote
ICGI
2004
Springer
15 years 11 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...
140
click to vote
IEICET
2007
15 years 6 months ago
2007
Bursty traffic is dominant in modern communication networks and keeps the call-level QoS assessment an open issue. ON-OFF traffic models are commonly used to describe bursty tra...
128
click to vote
DSD
2002
IEEE
15 years 11 months ago
2002
IEEE
We use a formal tool to extract Finite State Machines (FSM) based representations (lists of states and transitions) of sequential circuits described by flip-flops and gates. The...
181
click to vote
TEC
2008
15 years 6 months ago
2008
Fingerprinting is a technique for generating a representation-independent functional signature for a game playing agent. Fingerprints can be used to compare agents across represent...