Отрывок: ) For instance, this fact can be shown by brute force algorithm, which may be implemented using the remainder of this paper. However, we will not consider this example in more details. 5. Constructing walibad using its table of # In this section, we consider an example of inequivalent transformation of automaton 𝐿#. This transformation preserves the given table of binary relations #.We give a specific example of work of such an algorithm. In the next pape...
Полная запись метаданных
Поле DC | Значение | Язык |
---|---|---|
dc.contributor.author | Melnikov, B. | - |
dc.contributor.author | Dudnikov, V. | - |
dc.date.accessioned | 2017-05-19 15:16:28 | - |
dc.date.available | 2017-05-19 15:16:28 | - |
dc.date.issued | 2017 | - |
dc.identifier | Dspace\SGAU\20170517\63851 | ru |
dc.identifier.citation | Melnikov B. Some new heuristical algorithms for minimization of nondeterministic finite automata / B. Melnikov, V. Dudnikov // Сборник трудов III международной конференции и молодежной школы «Информационные технологии и нанотехнологии» (ИТНТ-2017) - Самара: Новая техника, 2017. - С. 1079-1085. | ru |
dc.identifier.uri | http://repo.ssau.ru/handle/Informacionnye-tehnologii-i-nanotehnologii/Some-new-heuristical-algorithms-for-minimization-of-nondeterministic-finite-automata-63851 | - |
dc.description.abstract | In this paper, we propose an algorithm example for the transformation of so-called complete automaton given by a table of binary relation #. At the same time, we know that for this table for the binary relation #, there exists some corresponding nondeterministic automaton having Waterloo-like badness. The proposed transformation, which is not equivalent, is the serial removal of a state and combining a pair of states. It gives the opportunity to build on the basis of the given relation # some automaton which also has the walibad-property. And, generally speaking, the obtained automaton is different from the known in advance. | ru |
dc.language.iso | en | ru |
dc.publisher | Новая техника | ru |
dc.subject | nondeterministic finite automata | ru |
dc.subject | universal automaton; covering set of blocks | ru |
dc.subject | covering automaton | ru |
dc.subject | Waterloo automaton | ru |
dc.subject | basis automaton | ru |
dc.subject | complete automaton | ru |
dc.title | Some new heuristical algorithms for minimization of nondeterministic finite automata | ru |
dc.type | Article | ru |
dc.textpart | ) For instance, this fact can be shown by brute force algorithm, which may be implemented using the remainder of this paper. However, we will not consider this example in more details. 5. Constructing walibad using its table of # In this section, we consider an example of inequivalent transformation of automaton 𝐿#. This transformation preserves the given table of binary relations #.We give a specific example of work of such an algorithm. In the next pape... | - |
Располагается в коллекциях: | Информационные технологии и нанотехнологии |
Файлы этого ресурса:
Файл | Описание | Размер | Формат | |
---|---|---|---|---|
paper 190_1079-1085.pdf | Основная статья | 696.52 kB | Adobe PDF | Просмотреть/Открыть |
Показать базовое описание ресурса
Просмотр статистики
Поделиться:
Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.