Synthesis of an automaton specified by the set of clauses
An approach to synthesis of an automaton specified by the logical formula in the conjunctive normal form (c.n.f.) is proposed. Although this approach exploits the method for synthesis of an automaton from the specification represented in the disjunctive normal form (d.n.f.), the synthesis is carried...
Saved in:
| Date: | 2015 |
|---|---|
| Main Author: | Chebotarev, A.N. |
| Format: | Article |
| Language: | Ukrainian |
| Published: |
PROBLEMS IN PROGRAMMING
2015
|
| Subjects: | |
| Online Access: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/12 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Problems in programming |
| Download file: | |
Institution
Problems in programmingSimilar Items
-
Synthesis of Σ-automata specified in the first-order logical languages LP and LF
by: A. N. Chebotarev
Published: (2018) -
Problems of synthesis of Σ-automata specified in languages LP and LF of first order logic
by: A. N. Chebotarev
Published: (2017) -
Level Set Structure of an Integrable Cellular Automaton
by: Takagi, T.
Published: (2010) -
Synthesis of a combined automaton with ASIC
by: A. A. Barkalov, et al.
Published: (2020) -
Automaton extensions of mappings on the set of words defined by finite Mealy automata
by: Osys, Miroslaw
Published: (2018)