Statements (55)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Technical Machine
finite state machine |
| gptkbp:allows |
regular languages
|
| gptkbp:canBeConvertedFrom |
gptkb:NFA
|
| gptkbp:canBeMinimized |
true
|
| gptkbp:complexity |
linear in input length
|
| gptkbp:contrastsWith |
gptkb:NFA
|
| gptkbp:definedIn |
5-tuple (Q, Σ, δ, q0, F)
|
| gptkbp:example |
binary string with even number of 0s
strings ending with 'ab' strings with no consecutive 1s |
| gptkbp:hasAcceptStates |
F
|
| gptkbp:hasApplication |
model checking
text search lexical analysis pattern matching protocol design |
| gptkbp:hasComponent |
transition function
start state input alphabet set of accept states set of states |
| gptkbp:hasDecidability |
emptiness problem is decidable
equivalence problem is decidable universality problem is decidable |
| gptkbp:hasDeterminism |
true
|
| gptkbp:hasEquivalence |
regular expressions
regular grammars |
| gptkbp:hasInputAlphabet |
Σ
|
| gptkbp:hasNonDeterminism |
false
|
| gptkbp:hasProperty |
gptkb:Kleene_star
gptkb:intersection Union complementation finite number of states concatenation deterministic transitions |
| gptkbp:hasStartState |
q0
|
| gptkbp:hasStates |
gptkb:Q
|
| gptkbp:hasTransitionFunction |
δ: Q × Σ → Q
|
| gptkbp:historicalPeriod |
introduced in 1950s
|
| https://www.w3.org/2000/01/rdf-schema#label |
DFA
|
| gptkbp:isTuringComplete |
false
|
| gptkbp:limitation |
cannot recognize non-regular languages
no memory beyond current state |
| gptkbp:represents |
state diagram
|
| gptkbp:standsFor |
gptkb:Deterministic_Finite_Automaton
|
| gptkbp:supportsAlgorithm |
minimization algorithm
subset construction |
| gptkbp:usedIn |
formal language theory
theory of computation |
| gptkbp:bfsParent |
gptkb:Department_of_Foreign_Affairs
gptkb:deterministic_finite_automaton gptkb:Dairy_Farmers_of_America |
| gptkbp:bfsLayer |
5
|