Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I
From MaRDI portal
Publication:1280907
DOI10.1007/BF02733106zbMath0917.68143OpenAlexW2018942122MaRDI QIDQ1280907
Publication date: 28 April 1999
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02733106
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (7)
Synthesis of \(\Sigma\)-automata specified in the first order logical languages LP and LF ⋮ On the class of L\(^*\)-language formulas that specify finite-memory finite-state machines ⋮ 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\) ⋮ Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\) ⋮ Problems of synthesis of \(\Sigma\)-automata specified in languages LP and LF of first order logic ⋮ Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). II
Cites Work
This page was built for publication: Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I
