Model reduction through an Hankel problem and finite state machines by Jameson, Neal Ward, 1978-

Get full text

CGRU and CONG: CONVERT and LISP Programs to Find the Congruence Relations of a Finite State Machine by McIntosh, Harold V.

“…CRGU is a CONVERT program, CONG its literal transcription into LISP, realized in the CTSS LISP of Project MAC, for finding all the congruence relations of a finite state machine whose transition table is given as an argument. …”
Get full text

REEX: A CONVERT Program to Realize the McNaughton-Yamada Analysis Algorithm by McIntosh, Harold V.

“…REEX is a CONVERT program, realized in the CTSS-LISP of Project Mac, for carrying out the McNaughton-Yamada analysis algorithm, whereby a regular expression is found describing the words accepted by a finite state machine whose transition table is given. Unmodified the algorithm will produce 4n terms representing an n-state machine. …”
Get full text

Unrecognizable Sets of Numbers by Minsky, Marvin, Papert, Seymour A.

“…When is a set A of positive integers, represented as binary numbers, "regular" in the sense that it is a set of sequences that can be recognized by a finite-state machine? Let pie A(n) be the number of members of A less than the integer n. …”
Get full text

Timeout Order Abstraction for Time-Parametric Verification of Loosely Synchronized Real-Time Distributed Systems by Umeno, Shinya, Lynch, Nancy Ann

Get full text
Get full text

Automated Formal Verification of the DHCP Failover Protocol Using Timeout Order Abstraction by Umeno, Shinya, Lynch, Nancy Ann

“…A resulting untimed model from TO-abstraction is a finite state machine, and therefore one can verify the model using a conventional model-checker. …”
Get full text
Get full text

A nanocryotron memory and logic family by Buzzi, Alessandro, Castellani, Matteo, Foster, Reed A., Medeiros, Owen, Colangelo, Marco, Berggren, Karl K.

“…These blocks may constitute a solid foundation for the development of nanocryotron logic circuits and finite-state machines with potential applications in the integrated processing and control of superconducting nanowire single-photon detectors.…”
Get full text

An analysis of the control hierarchy modeling of the CMS detector control system by Paus, Christoph M. E., Raginel, Olivier, Bauer, Gerry P, Sumorok, Konstanty C

“…The supervisory level of the Detector Control System (DCS) of the CMS experiment is implemented using Finite State Machines (FSM), which model the behaviours and control the operations of all the sub-detectors and support services. …”
Get full text
Get full text

Learning World Models in Environments with Manifest Causal Structure by Bergman, Ruth

“…Previous approaches to learning causal world models have concentrated on environments that are too "easy" (deterministic finite state machines) or too "hard" (containing much hidden state). …”
Get full text

A Deeply Pipelined CABAC Decoder for HEVC Supporting Level 6.2 High-tier Applications by Chen, Yu-Hsin, Sze, Vivienne

“…Additional techniques such as the state prefetch logic, latched-based context memory, and separate finite state machines are applied to minimize stall cycles, while multibypass- bin decoding is used to further increase the throughput. …”
Get full text
Get full text
Get full text

Reconfigurable Architectures for General-Purpose Computing by DeHon, Andre

“…For typical logic applications and finite- state machines, a DPGA can implement tasks in one-third the area of a traditional FPGA. …”
Get full text