Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

28 relations
Adjacency listAlgorithmAutomata theoryAutomata-based programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2003
2003
Bulk system reliability evaluation in a deregulated power industry
2002
2002
Transition to IPv6 in GPRS and WCDMA mobile networks
The limited size and structure of the Internet address space of IPv4 has caused difficulties in coping with the explosive… 
Review
1998
Review
1998
Software process modeling and enactment: an experience report related to problem tracking in an industrial project
The paper provides an overview of process research and the application of research results to practice and then describes process… 
1996
1996
An extended semantic foundation for Object-Z
  • A. Griffiths
  • Proceedings Asia-Pacific Software Engineering…
  • 1996
  • Corpus ID: 15604696
The paper argues that a strict notion of modularity is essential if the reuse of formally verified software components is to be… 
Highly Cited
1991
Highly Cited
1991
Fast sequential ATPG based on implicit state enumeration
The knowledge of the State Transition Graph (STG) of a sequential circuit helps in generating test sequences. For instance, by… 
Review
1990
Review
1990
Frame alignment in a digital carrier system-a tutorial
Four key timing parameters that are used as performance measures are defined; reframe time, false in-frame time, out-of-frame… 
1990
1990
Specifying modules to satisfy interfaces: A state transition system approach
SummaryWe defineinterface, module and the meaning ofM offers I, whereM denotes a module andI an interface. For a moduleM and… 
1990
1990
Functional test generation for finite state machines
A functional test generation method for finite-state machines is described. A functional fault model, called the single… 
1987
1987
A General Model for Memory-Based Finite-State Machines
A general model of a memory-based finite-state machine architecture is introduced, the 2k− decision machine (2k− D). The… 
Highly Cited
1982
Highly Cited
1982
The elucidation of solvent exchange mechanisms by high-pressure NMR studies
Abstract 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)