搜索资源列表
CA-OddRUlE
- 简单元胞自动机—奇偶规则(模式3)同或运算 - Simple cellular automata- with or operator of the parity rules (mode 3)
Traffic-observation-light-Solution2
- 自动机教程，交通观测灯的使用，有关交通信号的检测与处理原代码。-Automata tutorial- Traffic observation and the use of lights. Signal detection and processing of source code
05716329
- Evolutionary Design of Edge Detector Using Rule- Changing Cellular Automata
05584633
- Evolutionary Design of Edge Detector Using Rule- Changing Cellular Automata
01380502
- Evolutionary Design of Edge Detector Using Rule- Changing Cellular Automata
04678801
- Evolutionary Design of Edge Detector Using Rule- Changing Cellular Automata
05480830
- Evolutionary Design of Edge Detector Using Rule- Changing Cellular Automata
yuanbaozidongji
- 二维晶粒长大过程模拟。采用的是元胞自动机法，晶格数为五百乘五百。-Cellular automata machines
DFAminimization
- A program that minimizes a deterministic finite automata
new
- automata code for design dfa autmata and convert it to nfa
Word_Analyst
- 华东交通大学编译原理实验题，词法分析程序java源代码，赋值表达式的实现，有穷自动机-The east China jiaotong university, compiling principle experimental subject, lexical analysis program Java source code, and the realization of an assignment expression, have finite automata
aaa
- 初等元胞自动机,实现初等自动元胞细胞的生长-Elementary Cellular Automata
Minimize_Finite_Automata
- An implementation of Minimization of Finite Deterministic Automata.
cd4ef1.ZIP
- 基于启发式SCCs的广义B_chi自动机判空检测算法Based on the heuristic SCCs generalized B_chi automata empty detection algorithm-Based on the heuristic SCCs generalized B_chi automata empty detection algorithm
yxzdj
- 关键字：编译原理；算法；有限自动机 描述：有限自动机主要是应用一种巧妙的方法把一则文法化简并把程序当中不确定的走向确定化，使程序在每执行一步都有一个确定的走向。减少计算量，也使使用程序来判断字符串是否符合文法成为可能。-Compilation principle algorithm Finite automata
intersection
- MATLAB环境下多车道信号交叉口元胞自动机仿真 可以实现信号相位的仿真 可以计算交叉口各相位 各车道车辆延误-Microscopic simulation of signalised junctions based on Cellular Automata. For each signal phase. The code could run simulation separatly and produce travel delay by changing traffic volume.
AutoMat
- MFC制作的文法生成有限自动机程序。能够将你输入的文法转化成自动机。并且能够判断文法的对错。-MFC production grammar generates a finite automata program. You enter the grammar can be transformed into automata. Grammar and be able to judge right or wrong.
nfa-to-dfa
- 编译实验，实线有穷自动机，nfa到dfa-Compile the experiment, solid line finite automata, nfa to dfa
Regular-expres
- 实现有穷自动机，NFA到DFA的最小化，实现最长匹配-Realization of finite automata, NFA to DFA, minimize, the longest match
shiyan2
- 编译原理实验：程序段的单词识别。：给定某种语言的语法规则，生成识别该语言单词的确定的有穷自动机（DFA），然后通过该DFA对该语言的程序段进行单词识别，给出识别的单词序列，每个单词用二元式表示-Compiler principle experiment: block word recognition. : Given a language grammar rules to generate finite automata (DFA) identify the word of the langua