TRANSFORMATION OF A LANGUAGE L* SPECIFICATION OF AN FSM INTO AN AUTOMATA EQUIVALENT SPECIFICATION IN THE LANGUAGE L

被引:0
|
作者
Chebotarev, A. N. [1 ]
机构
[1] Natl Acad Sci Ukraine, Cybernet Inst, Kiev, Ukraine
关键词
specification language L*; there exists-formula; two-sided superword; Sigma-automaton; elimination of quantifiers; automata equivalence of specifications;
D O I
10.1007/s10559-010-9234-x
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A method is proposed to transform an FSM specification in the language L* into a specification in the language L. Using additional predicate symbols, the former specification is first transformed into a specification of an FSM with finite memory. Then this specification is transformed into an automata equivalent specification in the language L.
引用
收藏
页码:574 / 582
页数:9
相关论文
共 50 条