flâneur

Thompson's construction

en.wikipedia.org · 1,769 words · saved by 2 readers

Couldn't find lead section for Thompson's_construction

Thompson's construction - Wikipedia Jump to content From Wikipedia, the free encyclopedia Algorithm to transform a regular expression into a finite automaton In computer science , Thompson's construction algorithm , also called the McNaughton–Yamada–Thompson algorithm , [ 1 ] is a method of transforming a regular expression into an equivalent nondeterministic finite automaton (NFA). [ 2 ] This NFA can be used to match strings against the regular expression. This algorithm is credited to Ken Thompson . Regular expressions and nondeterministic finite automata are two representati

saved by

related reading