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...
Збережено в:
| Дата: | 2015 |
|---|---|
| Автор: | |
| Формат: | Стаття |
| Мова: | Ukrainian |
| Опубліковано: |
PROBLEMS IN PROGRAMMING
2015
|
| Теми: | |
| Онлайн доступ: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/12 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Problems in programming |
| Завантажити файл: |  |
Репозитарії
Problems in programming| Резюме: | 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 out without transforming c.n.f. into d.n.f. Owing to this fact the proposed method has the same efficiency as the method at which it is based. |
|---|