Search - automaton

Search - automaton - List

[Software Engineering] NFA DL : 0: 在非确定的有限自动机NFA中,由于某些状态的转移需从若干个可能的后续状态中进行选择,故一个NFA对符号串的识别就必然是一个试探的过程。这种不确定性给识别过程带来的反复,无疑会影响到FA的工作效率，所以我们有必要将NFA确定化。-In the non-deterministic finite automaton of the NFA, because of the transfer of certain state to be from a number of possible follow-up to the state to choose, so a NFA identification string of symbols must be on a trial process. This uncertainty to the recognition process brought about by repeated, it will undoubtedly affect the efficiency of the FA, so we need to determine of NFA.
Date : 2025-12-16 Size : 78kb User : 陈成
[Software Engineering] Cell_Automatic_and_Matlab DL : 0: 考虑如何编写有效的MATLAB的程序来实现这些元胞自动机。-MATLAB to consider how to write effective procedures to achieve these cellular automaton.
Date : 2025-12-16 Size : 225kb User : 小郑
[Software Engineering] lex_yacc.pdf DL : 0: A compiler or interptreter for a programminning language is often decomposed into two parts: Read the source program and discover its structure. Process this structure, e.g. to generate the target program. Lex and Yacc can generate program fragments that solve the first task. The task of discovering the source structure again is decomposed into subtasks: Split the source file into tokens (Lex). Find the hierarchical structure of the program (Yacc).-Lex helps write programs whose control flow is directed by instances of regular expressions in the input stream. It is well suited for editor-script type transformations and for segmenting input in preparation for a parsing routine. Lex source is a table of regular expressions and corresponding program fragments. The table is translated to a program which reads an input stream, copying it to an output stream and partitioning the input into strings which match the given expressions. As each such string is recognized the corresponding program fragment is executed. The recognition of the expressions is performed by a deterministic finite automaton generated by Lex. The program fragments written by the user are executed in the order in which the corresponding regular expressions occur in the input stream. Computer program input generally has some structure in fact, every computer program that does input can be thought of as defining an ``input language which it accepts. An input l
Date : 2025-12-16 Size : 9.76mb User : 欧曜玮
[Software Engineering] CA-matlab DL : 0: 元胞自动状态机的matlab仿真程序，包含多种自动机。-Cellular automaton state machine matlab simulation program, contains a variety of automatic machines.
Date : 2025-12-16 Size : 91kb User : Bill Huang
[Software Engineering] 2014NaSchmatlab DL : 0: 单车道matlab元胞自动机代码，超级好用，求通过，求下载-Lane cellular automaton matlab code
Date : 2025-12-16 Size : 27kb User : Frank
[Software Engineering] Cellular-automata DL : 0: 元胞自动机的经典案例，2013年数学建模交通流的元胞自动机代码-Cellular automata classic case, mathematical modeling of cellular traffic in 2013 automaton code
Date : 2025-12-16 Size : 16kb User : 大费
[Software Engineering] DFA DL : 0: Formal language large operations, Elevator DFA automata, including the DFA process diagrams and design thinking-Formal language large operations, Elevator DFA automaton
Date : 2025-12-16 Size : 15kb User : 吕安