Login/RegisterTechnical Interview Questions and Answers :: Finite Automata
Home > Technical Interview Q&A > Finite Automata > Q & A
Accenture (161)
Adobe (2)
Alcatel-Lucent (1)
Broadcom Ltd (1)
Wipro (86)
Virtusa (220)
IBM (35)
Aricent (47)
Tech Mahindra (13)
TCS (171)
Capgemini (33)
iGate (162)
Syntel Inc. (175)
AT&T (1)
Cisco (107)
Sapient (72)
Sopra Steria (138)
Societe Generale (75)
Goldman Sachs (5)
TCS NQT (7)
Huawei (11)
Wipro NLTH (36)
Paytm (67)
# C (123)
# C++ (187)
# DBMS (143)
# Soft. Engineering (77)
# Python (4)
# Finite Automata (6)
# SQL (108)
# Java (66)
# .NET (112)
# WebMethod (166)
# EDI (40)
# Informatica (94)
# Oracle Apps HRMS (106)
# Operating System (91)
# Data Structure (72)
# PHP (1)
# Unica (0)
# Oracle Apex (0)
# HR Question in TR (122)
# Networking (62)
# Hadoop (2)
# HTML (1)
# Oracle PLSQL (31)
# DPDK (Data Plane Development Kit) (40)
# Programming Qs. in TR (14)
- a finite set S of N states
- a special start state
- a set of final (or accepting) states
- a set of transitions T from one state to another, labeled with chars in C
1 / 6
Answer:
A finite automaton (FA) is a simple idealized machine used to recognize patterns within input taken from some character set (or alphabet) C. The job of an FA is to accept or reject an input depending on whether the pattern defined by the FA occurs in the input.
A finite automaton consists of:
Please Login First :
2 / 6
Answer:
No Discussion on this question yet!
Please Login First :
3 / 6
Answer:
No Discussion on this question yet!
Please Login First :
4 / 6
Answer:
What is the difference between FA , TG , GTG. ?
Make a FA which will accept only 3 strings 110.
Please Login First :
5 / 6
Answer:
This is not perfect answer
Please Login First :
6 / 6
Answer:
No Discussion on this question yet!
Please Login First :
