A finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model of computation. It isan abstract machine that can be in exactly one of a finite number of states at any given time. ...
One of the fundamental questions concerning statecharts is what the computation power of statecharts is. Until now, most descriptions consider that the computing power of statecharts is the same as that of Finite State Machines or Finite Automata, though no accurate arguments or proofs have been ...
It also raises questions about the class of automata that can serve as a basis for understanding the mind. I develop an account of implementation, linked to an appropriate class of automata, such that the requirement that a system implement a given automaton places a very strong constraint on ...
We answer two open questions by (Gruber, Holzer, Kutrib, 2009) on the state-complexity of representing sub- or superword closures of context-free grammars (CFGs): (1) We prove a (tight) upper bound of $2^{\\mathcal{O}(n)}$ on the size of nondeterministic finite automata (NFAs)...
We describe the automata theoretic setting of infinite games (given by "game graphs"), outline a new construction of winning strategies in finite-state games, and formulate some questions which arise for games over effectively presented ... W Thomas - Springer Berlin Heidelberg 被引量: 776发表:...
Actions:RepresentedbyArrowsbetweenstatesStartState:Beginningofapattern(Arrowhead)FinalState(s):Endofpattern(ConcentricCircles)•EachTDisDeterministic-Noneedtochoosebetween2differentactions!◎2005ECNUSEICompilers:Principles,Techniques,andTools4 ExampleTDs(P.100)>=:start0>6=other87 ...
In many testing and verification applications the learned non-deterministic finite state automata (NFA) models are exponentially smaller than the corresponding DFA models. So there is a significant gain, when we use learning algorithms that learn the models as succinct NFA instead of DFA. But the ...
Finite State Machines (FSMs) are an attractive model for embedded systems. The amount of memory required by such a model is always decidable, and is often an explicit part of its specification. Halting and performance questions are always decidable since each state can, in theory, be examined...
We shall deal with the following three questions concerning the power of alternation in automata theory: (1) What is the simplest kind of device for which ... J Hromkovi~ 被引量: 0发表: 0年 On the complexity of deciding fair termination of probabilistic concurrent finite-state programs In...