Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I
From MaRDI portal
Publication:1280907
DOI10.1007/BF02733106zbMath0917.68143MaRDI QIDQ1280907
Publication date: 28 April 1999
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Improved method of synthesis of an automaton from its specification in the language \(L\), Fictitiousness analysis of states of a finite-state machine synthesized from its specification transformed from the language \(L^*\) to the language \(L\), Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). II, On the class of L\(^*\)-language formulas that specify finite-memory finite-state machines, Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\)
Cites Work