REGULAR FORM SPECIFICATION OF L LANGUAGE DETERMINISTIC AUTOMATA
DOI:
https://doi.org/10.18372/2310-5461.1.5262Keywords:
deterministic automaton, language L, the rank of an atom, predicate, conjunction, atom zero rankAbstract
Some forms of representation of deterministic automata specifications in the language L are investigated. The use of such forms in the construction of specifications decreases the possibility of errors.
References
Чеботарев А. Н. Об одном подходе к функциональной спецификации автоматных систем. I // Кибернетика и системный анализ. — 1993. — № 3. — C. 31—42.
Чеботарев А. Н. Синтез алгоритма по его логической спецификации // Управляющие системы и машины. — 2004. — №5. — С. 53—60.
Чеботарев А. Н., Куривчак О. И. Аппроксимация множеств сверхслов формулами языка L. // Кибернетика и системный анализ. — 2007. — № 6. — C. 18—26.
Чеботарев А. Н., Алистратов О. В. Построение логической спецификации реактивного алгоритма // Проблемы программирования. — 2002. — № 1—2. — C. 154—160.
Downloads
How to Cite
Issue
Section
License
The scientific journal adheres to the principles of Open Access and provides free, immediate, and permanent access to all published materials without financial, technical, or legal barriers for readers.
All articles are published in Open Access under the Creative Commons Attribution 4.0 International (CC BY 4.0) license.
Copyright
Authors who publish their works in the journal:
-
retain the copyright to their publications;
-
grant the journal the right of first publication of the article;
-
agree to the distribution of their materials under the CC BY 4.0 license;
-
have the right to reuse, archive, and distribute their works (including in institutional and subject repositories), provided that proper reference is made to the original publication in the journal.
