Search - automaton

Search - automaton - List

[ELanguage] 有穷自动机识别无符号数 DL : 0: 有穷自动机识别源码- Has the poor automaton recognition source code
Date : 2008-10-13 Size : 39.52kb User : 秋水寒
[ELanguage] 有穷自动机识别无符号数 DL : 0: 有穷自动机识别源码- Has the poor automaton recognition source code
Date : 2025-12-16 Size : 39kb User : 秋水寒
[ELanguage] formal DL : 0: 形式语言与自动机讲义（考博必备）。形式语言是研究自然语言和人工语言的数学工具，以状态自动机为基础，建立抽象机器模型。-Formal Languages and Automata lectures (考博necessary). The form of language is the study of natural language and artificial language of mathematical tools to state automaton, based on the abstract machine model.
Date : 2025-12-16 Size : 12.61mb User : kobe
[ELanguage] jj DL : 0: 编译原理一个简单自动机的源程序判断一个输入的串能否被该自动机接受-Compilation Principle of a simple automaton source to determine whether an input string accepted by the automaton
Date : 2025-12-16 Size : 140kb User : yuu
[ELanguage] Token_compile DL : 0: 扫描器设计（4学时） 1.实验目的熟悉并实现一个扫描器。 2.实验类型设计性。 3.实验基本要求 (1) 设计扫描器的自动机； (2) 设计翻译、生成Token的算法； (3) 编写代码并上机调试运行通过。 • 输入——源程序文件； • 输出—— 相应的Token序列；关键字表和界符表；符号表和常数表； -Scanner design (4 hours) 1. The experiment was familiar with and the realization of a scanner. 2. Experimental type design. 3. The basic requirements of the experiment (1) the design of the scanner automaton (2) design translation, Token Generation Algorithm (3) write code and debug on the machine to run through.
Date : 2025-12-16 Size : 1011kb User : js
[ELanguage] zhidongji DL : 0: 编译原理课程设计有限自动机的运行 -Compilation Principle course design operation of finite automaton
Date : 2025-12-16 Size : 2kb User : tony
[ELanguage] Form1 DL : 0: c#编写浮点数的DFA 由自动机模式构造内涵详细步骤 -c# float prepared by the DFA automaton model of tectonic connotation of the detailed steps
Date : 2025-12-16 Size : 548kb User : liu
[ELanguage] 050420106 DL : 0: 自动机的确定化和最小化,是我自己写的文档哈，感谢大家下载-the deterministic and minimum of automaton
Date : 2025-12-16 Size : 178kb User : 李四化
[ELanguage] Automate DL : 0: graphic Automaton simulator,NFA to DFA conversion and minimisation
Date : 2025-12-16 Size : 676kb User : darkzan
[ELanguage] NFA DL : 0: 用C#编写的不确定有穷自动机NFA=>确定有穷自动机DFA的转换算法，-Uncertainty with C#, finite automata NFA => OK finite automaton DFA conversion algorithm
Date : 2025-12-16 Size : 1.5mb User : 徐华江
[ELanguage] AjaxParser DL : 0: 一个VC++有穷自动机分析内核的源代码，为 DocWizard 做词法分析准备，本分析内核可以在不改变代码的情况下分析不同的 DFA……有意思吧，看看代码就会明白。 -VC++ there is a finite automaton of the kernel source code, to prepare for the DocWizard do lexical analysis, this analysis does not change the kernel code can analyze different circumstances DFA ... ... it is interesting to see if the code will understand.
Date : 2025-12-16 Size : 48kb User : madud00106
[ELanguage] demo DL : 0: VC++从正则表达式到有穷自动机实例,很不错的demo-VC++ from the regular expression to finite automaton instance
Date : 2025-12-16 Size : 247kb User : 吴文霞
[ELanguage] FSM DL : 0: 功能强大的汇编语言词法分析器，可以读入一行汇编语言，再输出扫描结果。使用汇编语言开发，有限自动机原理。-Powerful assembly language lexical analyzer, can be read into the line of assembly language, and then export the scan results. Assembly language development, finite automaton.
Date : 2025-12-16 Size : 3kb User : KnGine
[ELanguage] 10803070102_daiyongchuan DL : 0: 其中包括词法分析器和语法分析器，还包括预测分析法以及正规式转换为不确定的有穷自动机、不确定的有穷自动机转换为确定的有穷自动机- Including the lexical analyzer and parser, but also forecast analysis and formal style uncertainty into finite automata, finite automata uncertainty into a deterministic finite automaton
Date : 2025-12-16 Size : 40.45mb User : 郭晓峰
[ELanguage] DFA DL : 0: Compiler tech:Program For Acceptance Of A String Using deterministic finite automaton (DFA) which is a finite state machine accepting finite strings of symbols. For each state, there is a transition arrow leading out to a next state for each symbol. Upon reading a symbol, a DFA jumps deterministically from a state to another by following the transition arrow
Date : 2025-12-16 Size : 1kb User : jack
[ELanguage] NFA_TO_DFA DL : 0: 不确定有限状态自动机的确定化(NFA_TO_DFA) 编译原理实验-Uncertain finite state automaton and the determination of (NFA_TO_DFA) Compiler Principle Experiment
Date : 2025-12-16 Size : 5kb User : guochenggai