CODEWITHSUNDEEP
computer-scienceautomata
Uzair Farooq
Uzair Farooq

Reputation: 927

Applications of Finite Automata in Computer Science

I have to choose a topic from applications of Finite Automata for my presentation. What are some applications of Finite Automata in Computer Science? They might be in programming.

Upvotes: 0

Views: 5346

Answers (3)

Pavani Lake
Pavani Lake

Reputation: 1

The automata method enables computer scientists to understand how machines compute functions and solve problems, as well as what it means for a function to be defined as computable or for a question to be described as decidable.

Applications: 1.For the designing of lexical analysis of a compiler. 2.For recognizing the pattern using regular expressions. 3.For the designing of the combination and sequential circuits using Mealy and Moore Machines. 4.Used in text editors. 5.For the implementation of spell checkers.

Finite Automata(FA) is the simplest machine to recognize patterns. The finite automata or finite state machine is an abstract machine that has five elements or tuples. It has a set of states and rules for moving from one state to another but it depends upon the applied input symbol.

Finite automata can be represented by input tape and finite control. Input tape: It is a linear tape having some number of cells. Each input symbol is placed in each cell. Finite control: The finite control decides the next state on receiving particular input from input tape.

Upvotes: 0

Supriya Sangadala
Supriya Sangadala

Reputation: 1

A finite automata is highly useful for designing Lexical Analyzers, as it can be applied to many different types of data. Text editors can be designed with a finite automata. Spell checkers can be designed using a finite automata. Transducer is a tool for designing sequential circuits (a finite automata). 1.A finite automata (FA) is a method for designing a compiler’s lexical analysis. 2.Automata Push Down (PDA) – For designing the parsing phase of a compiler (Syntax Analysis) 3.Genetic programming can be implemented using linear Bounded Automata (LBA). 4.The Turing Machine (TM) – a machine that can read minds.

Upvotes: 0

Basile Starynkevitch
Basile Starynkevitch

Reputation: 1

Lexing, parsing, scheduling, networking (e.g. TCP & routing), event-driven programming ... use finite state automata.

Actually, automata are used everywhere in computer science & in programming. It might be harder to name programming techniques which don't even remotely use them.

But your question belongs more to programmers than to here.

Upvotes: 2

Related Questions