期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A Program Study of the Union of Semilattices on the Set of Subsets of Grids of Waterloo Language
1
作者 Mikhail E. Abramyan Boris F. Melnikov 《Journal of Applied Mathematics and Physics》 2023年第5期1459-1470,共12页
The aim is to study the set of subsets of grids of the Waterloo language from the point of view of abstract algebra and graph theory. The study was conducted using the library for working with transition graphs of non... The aim is to study the set of subsets of grids of the Waterloo language from the point of view of abstract algebra and graph theory. The study was conducted using the library for working with transition graphs of nondeterministic finite automata NFALib implemented by one of the authors in C#, as well as statistical methods for analyzing algorithms. The results are regularities obtained when considering semilattices on a set of subsets of grids of the Waterloo language. It follows from the results obtained that the minimum covering automaton equivalent to the Waterloo automaton can be obtained by adding one additional to the minimum covering set of grids. . 展开更多
关键词 nondeterministic finite automata Universal Automaton Basic Automaton Grid Covering Automaton Equivalent Transformation Algorithms Water-loo Automaton
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部