Зв’язок мереж Петрі з бездужковим польським записом
We propose Petri nets that produce languages of Polish notation and reverse Polish notation for propositional formulas and mathematical expressions. Propositional formulas can contain a given number of variables and mathematical expressions. Arithmetic expressions can contain a given number of varia...
Збережено в:
| Дата: | 2016 |
|---|---|
| Автор: | |
| Формат: | Стаття |
| Мова: | Російська |
| Опубліковано: |
The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute"
2016
|
| Теми: | |
| Онлайн доступ: | http://journal.iasa.kpi.ua/article/view/59334 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | System research and information technologies |
Репозитарії
System research and information technologies| Резюме: | We propose Petri nets that produce languages of Polish notation and reverse Polish notation for propositional formulas and mathematical expressions. Propositional formulas can contain a given number of variables and mathematical expressions. Arithmetic expressions can contain a given number of variables and constants. We also propose inhibitor nets that produce the fixed-point binary numbers in mathematical expressions for above-mentioned languages. The technique of the nets construction allows to use arbitrary functions with a given arity. We also propose a coloured Petri net for calculating values of propositional formulas in reverse Polish notation. The technique of the net construction allows to use arbitrary functions with a given arity using a truth table of a corresponding function. |
|---|