finite automata

Computing portal

Here is a list of articles in the category Finite automata of the Computing portal that unifies foundations of mathematics and computations using computers.

The main article for this category is Finite-state machine.

## Pages in category "Finite automata"

The following 39 pages are in this category, out of 39 total.

###

* Finite-state machine

### A

* Alternating finite automaton
* Aperiodic finite state automaton

### B

* Büchi automaton

### C

* Co-Büchi automaton
* Cobham's theorem

### D

* Finite-state machine with datapath
* Deterministic finite automaton
* Tagged Deterministic Finite Automaton
* DFA minimization

### F

* Finite-state transducer
* Software:Flex (lexical analyser generator)
* Software:Foma

### G

* Generalized nondeterministic finite automaton
* Glushkov's construction algorithm

### K

* Kleene's algorithm

### L

* Levenshtein automaton
* Software:Lex

### M

* Moore machine
* Moore reduction procedure
* Muller automaton

### N

* NFA minimization
* NFA to DFA conversion
* Nondeterministic finite automaton

### O

* Ω-automaton

### P

* Permutation automaton
* Powerset construction
* Probabilistic automaton
* Pumping lemma for regular languages

### Q

* Quantum finite automata
* Quotient automaton

### S

* Self-verifying finite automaton
* State complexity

### T

* Thompson's construction
* Trie
* Two-way finite automaton

### U

* Unambiguous finite automaton
* Union of two regular languages

### W

* Weighted automaton

Retrieved from "https://handwiki.org/wiki/index.php?title=Category:Finite_automata&oldid=515828"