State transition table

Known as: State tables, State transition tables, STT 
In automata theory and sequential logic, a state transition table is a table showing what state (or states in the case of a nondeterministic finite… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
We propose a fast and simple binary arithmetic coder, STT-coder, in which arithmetic operation of dividing the probability… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2012
2012
In terms of the concepts of state and state transition, a new heuristic random search algorithm named state transition algorithm… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
An algorithm, the bootstrap filter, is proposed for implementing recursive Bayesian filters. The required density of the state… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 11
Is this relevant?
Highly Cited
2000
Highly Cited
2000
In this paper we investigate the performance of multicast routing protocols in wireless mobile ad hoc networks. An ad hoc network… (More)
  • table 11
  • table V
  • table IV
  • table V
  • figure 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
This article presents an attack description language. This language is based on logic and uses a declarative approach. In the… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2000
Highly Cited
2000
In this paper, we propose a quantitative model for dialog systems that can be used for learning the dialog strategy. We claim… (More)
  • figure 2
  • figure 3
  • figure 5
  • figure 7
  • figure 6
Is this relevant?
1996
1996
In this paper we present a general concept of state transition diagrams well suited for various modeling purposes Our notation is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
| This paper presents a new approach to representing and detecting computer penetrations in real-time. The approach, called state… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
If you put tomfoolery into a computer, nothing comes out of it but tomfool-ery. But this tomfoolery, having passed through a very… (More)
  • figure 4.3
  • figure 4.7
  • figure 4.11
  • figure 4.12
  • figure 4.13
Is this relevant?
Highly Cited
1990
Highly Cited
1990
In the reactive model [Pnu85] of classical concurrency theory, a process reacts to stimuli presented by its environment. A… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?