Pages that link to "Item:Q1922337"
From MaRDI portal
The following pages link to Synthesis of a nondeterministic automaton from its logical specification. I (Q1922337):
Displaying 12 items.
- Improved method of synthesis of an automaton from its specification in the language \(L\) (Q464896) (← 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)
- Extension of the automaton specification logical language and the synthesis problem (Q1385765) (← 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)
- Automaton synthesis from a nonformal specification (Q1905170) (← links)
- Determinization of logical specifications of automata (Q1907766) (← links)
- Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\) (Q2452755) (← links)
- Synthesis of the automaton part of optimal logico-dynamical system (Q2487443) (← links)
- Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). I (Q2508787) (← links)
- Inductive synthesis of an automaton from its specification in the logical language \({\mathfrak L}\) (Q5942109) (← links)
