|
gptkbp:instanceOf
|
gptkb:finite_automaton
|
|
gptkbp:allows
|
number of symbols in regular expression
|
|
gptkbp:alsoKnownAs
|
position automaton
|
|
gptkbp:builtBy
|
regular expression
|
|
gptkbp:convertedTo
|
gptkb:deterministic_finite_automaton
|
|
gptkbp:equivalentTo
|
NFA without epsilon transitions
|
|
gptkbp:hasAcceptingStates
|
positions that can be last in a match
|
|
gptkbp:hasInitialState
|
state 0
|
|
gptkbp:hasNoEpsilonTransitions
|
true
|
|
gptkbp:hasStateForEach
|
position in regular expression
|
|
gptkbp:hasTransition
|
from state i to state j if symbol at position i can be followed by symbol at position j
|
|
gptkbp:introducedIn
|
1961
|
|
gptkbp:isNonDeterministic
|
true
|
|
gptkbp:namedAfter
|
gptkb:Victor_Glushkov
|
|
gptkbp:relatedTo
|
gptkb:finite_state_machine
automata theory
Thompson's construction
|
|
gptkbp:state
|
n+1
|
|
gptkbp:usedFor
|
regular expression matching
|
|
gptkbp:usedIn
|
lexical analysis
pattern matching algorithms
|
|
gptkbp:bfsParent
|
gptkb:Viktor_Glushkov
|
|
gptkbp:bfsLayer
|
7
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Glushkov automaton
|