![]() A current state is determined by past states of the system and many problems are expressed in terms of finite state machine such as control applications, compilers, lexers, speech recognition or string matching.įor example, in lexing HTML, input string and lexical specifications are given and we have to find lexemes. How can we efficiently represent this problem? Contextįinite state machine (FSM) allows for the concept of history, which is referred to as a state. ![]() Many problems take a sequence of input events (or string) and map it to a sequence of actions or output events (or string). ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |