Yahoo India Web Search

Search results

1. Dictionary

   automata

   /ɔːˈtɒmətə/

   • ▪ ▶automaton

   Scrabble Points: 10

   • A

     1

   • U

     1

   • T

     1

   • O

     1

   • M

     3

   • A

     1

   • T

     1

   • A

     1

   Powered by Oxford Dictionaries

   More definitions, origin and scrabble points

2. www.geeksforgeeks.org › theory-of-computationAutomata Tutorial - GeeksforGeeks

   www.geeksforgeeks.org › theory-of-computation

   • Cached

   Jun 12, 2024 · Learn the basics and advanced topics of automata theory, a branch of the theory of computation. Automata are abstract machines that can perform computations on strings of symbols according to a set of rules.

   • Introduction of Theory of Computation

     Automata theory (also known as Theory Of Computation) is a...

3. Videos

   • 

     5:18

     youtube.com

     Lec-3: What is Automata in TOC | Theory of Computation

     2 Mar 2020

     874.2K views

   • 

     9:23

     youtube.com

     INTRODUCTION TO AUTOMATA THEORY AND ITS APPLICATIONS || THEORY OF COMPUTATION || FORMAL LANGUAGES

     2 Oct 2021

     207.8K views

   • 

     12:16

     youtube.com

     1. Introduction to Automata theory

     23 Jan 2019

     216.5K views

   View all

4. en.wikipedia.org › wiki › Automata_theoryAutomata theory - Wikipedia

   en.wikipedia.org › wiki › Automata_theory

   • Cached

   Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical computer science with close connections to mathematical logic. The word automata comes from the Greek word αὐτόματος, which means "self-acting, self-willed, self-moving". An ...

5. www.javatpoint.com › theory-of-automataTheory of Automata - Javatpoint

   www.javatpoint.com › theory-of-automata

   • Cached

   Learn the basics of automata theory, a branch of computer science and mathematics that studies abstract machines and computation problems. Find definitions, examples, and diagrams of symbols, alphabets, strings, and languages.

6. www.tutorialspoint.com › automata_theory › automataAutomata Theory Introduction - Online Tutorials Library

   www.tutorialspoint.com › automata_theory › automata

   • Cached

   Learn what an automaton is and how to represent it formally. Find out the definitions and examples of alphabet, string, language, and related terminologies in automata theory.

7. www.geeksforgeeks.org › introduction-of-theory-ofIntroduction of Theory of Computation - GeeksforGeeks

   www.geeksforgeeks.org › introduction-of-theory-of

   • Cached

   Jul 19, 2022 · Learn the basics of automata theory, a branch of computer science and mathematics that studies simple machines and their logic. Find out how to represent languages, symbols, strings, and regular expressions using automata and closure operations.

   • Video Duration: 25 min

8. cs.stanford.edu › automata-theory › basicsBasics of Automata Theory - Stanford University

   cs.stanford.edu › automata-theory › basics

   • Cached

   Automata Theory is an exciting, theoretical branch of computer science. It established its roots during the 20th Century, as mathematicians began developing - both theoretically and literally - machines which imitated certain features of man, completing calculations more quickly and reliably. The word automaton itself, closely related to the ...

9. People also ask

   What is automata theory in Computer Science?

   • It is a theory in theoretical computer science with close connections to mathematical logic. The word automata comes from the Greek word αὐτόματος, which means "self-acting, self-willed, self-moving". An automaton (automata in plural) is an abstract self-propelled computing device which follows a predetermined sequence of operations automatically.

   Automata theory - Wikipedia

   en.wikipedia.org/wiki/Automata_theory

   See all results for this question

   What to learn in automata tutorial?

   • In this Automata Tutorial, you’ll learn all the basic to advanced topics like Regular languages and finite automata, Context free Grammar and Context-free language, turning machines, etc. DFA in LEX code which accepts even number of zeros and even number of ones. ‘Quizzes’ on Theory Of Computation ! ‘Practice Problems’ on Theory of Computation !

   Automata Tutorial - GeeksforGeeks

   www.geeksforgeeks.org/theory-of-computation-automata-tutorials/

   See all results for this question

   What is the simplest automata used for computation?

   • The simplest automata used for computation is a finite automaton. It can compute only very primitive functions; therefore, it is not an adequate computation model. In addition, a finite-state machine's inability to generalize computations hinders its power.

   Basics of Automata Theory - Stanford University

   cs.stanford.edu/people/eroberts/courses/soco/projects/2004-05/automata-theory/basics.html

   See all results for this question

   How are automata classified?

   • Automata are often classified by the class of formal languages they can recognize, as in the Chomsky hierarchy, which describes a nesting relationship between major classes of automata. Automata play a major role in the theory of computation, compiler construction, artificial intelligence, parsing and formal verification .

   Automata theory - Wikipedia

   en.wikipedia.org/wiki/Automata_theory

   See all results for this question

10. en.wikipedia.org › wiki › Finite-state_machineFinite-state machine - Wikipedia

    en.wikipedia.org › wiki › Finite-state_machine

    • Cached

    Finite-state machine. A finite-state machine ( FSM) or finite-state automaton ( FSA, plural: automata ), finite automaton, or simply a state machine, is a mathematical model of computation. It is an abstract machine that can be in exactly one of a finite number of states at any given time. The FSM can change from one state to another in ...