Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Language Recognition
Description Deterministic Final-State Automaton (DFA) is a directed multigraph whose vertices are called Given a language with a finite set of words it is always possible to construct a DFA that defines this language. The picture on the left shows such DFA for the language consisting of three words: Your task is to find the minimum number of states in a DFA that defines the given language. Input The first line of the input file contains a single integer number Output Write to the output file a single integer number — the minimal number of states in a DFA that defines the language from the input file. Sample Input
Sample Output
Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator