File:NFASimpleExample Runs10.gif
Summary
| Description |
English: Graph of all possible runs of the nondeterministic finite automaton shown at File:NFASimpleExample.svg on the input string "10". That string is not accepted by the automaton, since no path from the start state to an accepting state exists. Arc label (and color): input symbol, node label: state, green: start state, red: accept state(s). |
| Date | |
| Source | Own work |
| Author | Jochen Burghardt |
| Other versions | File:NFASimpleExample Runs10.gif * File:NFASimpleExample Runs1011.gif |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
This file is licensed under the Creative Commons Attribution-Share Alike 4.0 International 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.
