This is a file from the Wikimedia Commons


From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Original file(SVG file, nominally 453 × 303 pixels, file size: 16 KB)


English: A nondeterministic finite automaton (NFA) used as a construction block for Thompson's construction algorithm converting a regular expression of the form s|t into a NFA.
Source Own work
Author Trapmoth
Other versions n6


I, the copyright holder of this work, hereby publish it under the following license:
w:en:Creative Commons

attribution share alike

This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported license.
You are free:
  • to share – to copy, distribute and transmit the work
  • to remix – to adapt the work
Under the following conditions:
  • attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  • share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.


Add a one-line explanation of what this file represents

Items portrayed in this file


1 October 2012

File history

Click on a date/time to view the file as it appeared at that time.

current08:45, 30 May 2014Thumbnail for version as of 08:45, 30 May 2014453 × 303 (16 KB)Jochen Burghardtindicated subautomata by color
20:58, 1 October 2012Thumbnail for version as of 20:58, 1 October 2012453 × 303 (16 KB)TrapmothUser created page with UploadWizard
The following pages on the English Wikipedia use this file (pages on other projects are not listed):

Global file usage

The following other wikis use this file: