| Display title | Unambiguous finite automaton |
| Default sort key | Unambiguous finite automaton |
| Page length (in bytes) | 10,001 |
| Namespace ID | 0 |
| Page ID | 48975671 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | Fewer than 30 watchers |
| Number of redirects to this page | 4 |
| Counted as a content page | Yes |
| Wikidata item ID | Q1306211 |
| Central description | special kind of a nondeterministic finite automaton (NFA). Each deterministic finite automaton (DFA) is an UFA, but not vice versa. DFA, UFA, and NFA recognize exactly the same class of formal languages |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | Arthur MILCHIOR (talk | contribs) |
| Date of page creation | 00:30, 2 January 2016 |
| Latest editor | JJMC89 bot III (talk | contribs) |
| Date of latest edit | 06:31, 14 April 2025 |
| Total number of edits | 57 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
| Transcluded templates (43) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
