Synthesis of a procedural representation of an automaton specified in the logical language L^*. I
From MaRDI portal
Publication:1280907
Recommendations
- Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). II
- Inductive synthesis of an automaton from its specification in the logical language \({\mathfrak L}\)
- Synthesis of \(\Sigma\)-automata specified in the first order logical languages LP and LF
- Synthesis of a nondeterministic automaton from its logical specification. I
- Extension of the automaton specification logical language and the synthesis problem
- Improved method of synthesis of an automaton from its specification in the language \(L\)
- Problems of synthesis of -automata specified in languages LP and LF of first order logic
- Synthesis of a nondeterministic automaton from its logical specification. II
- scientific article; zbMATH DE number 3880600
- Automaton synthesis from a nonformal specification
Cites work
Cited in
(12)- 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\)
- Inductive synthesis of an automaton from its specification in the logical language \({\mathfrak L}\)
- Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\)
- scientific article; zbMATH DE number 3570363 (Why is no real title available?)
- Synthesis of \(\Sigma\)-automata specified in the first order logical languages LP and LF
- 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
- Harmonization of automata specifications represented in the language L
- Synthesis of a nondeterministic automaton from its logical specification. II
- On the class of L\(^*\)-language formulas that specify finite-memory finite-state machines
- Synthesis of a nondeterministic automaton from its logical specification. I
This page was built for publication: Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1280907)