Pages that link to "Item:Q1385765"

The following pages link to Extension of the automaton specification logical language and the synthesis problem (Q1385765):

Displaying 19 items.

• Harmonization of automata specifications represented in the language L (Q334231) (← links)
• Fictitiousness analysis of states of a finite-state machine synthesized from its specification transformed from the language \(L^*\) to the language \(L\) (Q465906) (← links)
• Problems of synthesis of \(\Sigma\)-automata specified in languages LP and LF of first order logic (Q681718) (← links)
• Approximation of sets of superwords by \(L\)-language formulas (Q941189) (← links)
• Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I (Q1280907) (← links)
• Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). II (Q1280979) (← links)
• On an approach to functional specification of automata systems. II (Q1333690) (← links)
• Synthesis of \(\Sigma\)-automata specified in the first order logical languages LP and LF (Q1616245) (← links)
• Some subsets of monadic first-order logic (MFO) used for the specification and synthesis of \(\Sigma\)-automata (Q1709455) (← links)
• Synthesis of a nondeterministic automaton from its logical specification. II (Q1816006) (← links)
• On an approach to functional specification of automata systems. III (Q1842385) (← links)
• Consistency test for simple specifications of automaton systems (Q1905143) (← links)
• Synthesis of a nondeterministic automaton from its logical specification. I (Q1922337) (← links)
• On the class of L\(^*\)-language formulas that specify finite-memory finite-state machines (Q1956960) (← links)
• Separable resolution method for checking the satisfiability of formulas in the language \({\mathfrak L}\) (Q1968528) (← links)
• From LP formulas of the form \(F(t)\) to \(-\omega \)-regular expressions (Q2215841) (← links)
• Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\) (Q2452755) (← links)
• (Q4263079) (← links)
• Inductive synthesis of an automaton from its specification in the logical language \({\mathfrak L}\) (Q5942109) (← links)