Extension of the automaton specification logical language and the synthesis problem
From MaRDI portal
Publication:1385765
DOI10.1007/BF02366857zbMath0893.68099MaRDI QIDQ1385765
Publication date: 3 August 1998
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (8)
Synthesis of \(\Sigma\)-automata specified in the first order logical languages LP and LF ⋮ Some subsets of monadic first-order logic (MFO) used for the specification and synthesis of \(\Sigma\)-automata ⋮ On the class of L\(^*\)-language formulas that specify finite-memory finite-state machines ⋮ 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\) ⋮ Approximation of sets of superwords by \(L\)-language formulas ⋮ 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}^*\). I
Cites Work
This page was built for publication: Extension of the automaton specification logical language and the synthesis problem
