On the class of L*-language formulas that specify finite-memory finite-state machines

Authors:
A. N. Chebotarev
Affiliations:
Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2010

Citing 0
Cited 2

Transformation of a language L* specification of an FSM into an automata equivalent specification in the language L

Cybernetics and Systems Analysis
Compositional approach to the development of reactive algorithms

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

The class of L*-language specifications that specify finite-memory finite-state machines is characterized. The transformation of an L*-language specification into an equivalent specification that specifies a finite-memory finite-state machine is substantiated.