CS402 GDB SOLUTION 2021
ID: your id
NAME: your name
SOLUTION:
Finite Automaton with 2 Stacks:
Finite State Machines (FSM), also known as Finite State Automation (FSA), at their simplest, are models of the behaviors of a system or a complex object, with a limited number of defined conditions or modes, where mode transitions change with circumstance. Finite state machines consist of 4 main elements;
States which define behavior and they may produce actions.
Rules or conditions that must be met to allow a state transition
Input events which are either externally or internally generated, which may possibly trigger rules and lead to state transitions.
A finite state machine must have an initial state which provides a starting point, and a current state which remembers the product of the last state transition. Received input events act as triggers, which cause an evaluation of some kind of the rules that gover, the transitions from the current state to other states. The best way to visualize an FSM is to think of it as a flow chart or a directed graph of states, though as will be shown there are more accurate abstract modeling techniques that can be used.
Some Major GNU Spelling Checkers:
Ispell: Ispell is a spelling checker for UNIX that supports most Western languages. It offers several interfaces, including a programmatic interface for use by editors such as emacs. Unlike GNU
Aspell, ispell will only suggest corrections that are based on a Damerau-Levenshtein distance of it will not attempt to guess more distant corrections based on English pronunciation rules.
GNU Aspell: GNU Aspell, usually called just Aspell, is a free software spell checker designed to replace Ispell. It is the standard spelling checker software for the GNU software system. It also compiles for other Unix-like operating systems and Microsoft Windows,
Hun spell: Hun spell is a spell checker and morphological analyzer designed for languages with rich morphology and complex word compounding or character encoding, originally designed for Hungarian language.
MySpell: MySpell was started by Kevin Hendricks to integrate various open-source spelling checkers into the OpenOffice.org build. With a little prodding from Kevin Atkinson, the author of Pspell and Aspell, a new spelling checker (MySpell) was written in C++ that supported affix compression, based on Ispell.
0 Comments