Category:Thompson's construction (formal language theory)
Jump to navigation
Jump to search
Algorithm relating regular expressions to NFAs | |||||
Upload media | |||||
Instance of | |||||
---|---|---|---|---|---|
| |||||
Media in category "Thompson's construction (formal language theory)"
The following 22 files are in this category, out of 22 total.
-
Automate par construction de Gluskkov - version finale.jpg 995 × 516; 96 KB
-
Automate par construction de Gluskkov - version linéaire.jpg 1,002 × 516; 104 KB
-
Automate-de-Thompson.png 754 × 173; 21 KB
-
AutomatePourEtoile.png 459 × 131; 9 KB
-
AutomatePourProduit.png 474 × 95; 5 KB
-
AutomatePourUnion.png 444 × 160; 9 KB
-
AutomatePourVideMotVideLettre.png 662 × 74; 7 KB
-
Clausura ER AFND-e.jpg 450 × 130; 8 KB
-
Concat ER AFND-e.jpg 540 × 90; 8 KB
-
Fsm grammar.png 768 × 604; 35 KB
-
Fsm grammar.svg 550 × 405; 918 bytes
-
NFA regexp concat.svg 440 × 80; 18 KB
-
NFA regexp kleene.svg 410 × 170; 17 KB
-
NFA regexp sum.svg 370 × 160; 21 KB
-
Small-thompson-example.svg 887 × 483; 28 KB
-
Suma ER AFND-e.png 550 × 280; 32 KB
-
Thompson-a-symbol.svg 278 × 54; 9 KB
-
Thompson-concat.svg 398 × 128; 12 KB
-
Thompson-epsilon.svg 278 × 54; 9 KB
-
Thompson-kleene-star.svg 503 × 251; 15 KB
-
Thompson-or.svg 453 × 303; 16 KB