0
== == As per your question, automata, If I remember correctly, is another word for robots, like the ones created in a factory in Grandia 2. I don't know if that term has ever been used outside of that game, but I guess that it is possible. If it is, it most likely refers to some Japanese robot prototype and the new technological advances that it is being programmed to do, such as walk, serve drinks, and talk. In art, on the other hand, Automata refers to a mechanism that, once set in motion, can continue to operate independantly. A more complete answer can be found here: http://www.answers.com/topic/automata-2 Hope that helps.
What else can I help you with?
What is full form of DFA and NFA?
DFA - deterministic finite automata NFA - non-deterministic finite automata
What is dfa and nfa?
DFA - Deterministic Finite Automata NFA - Non-Deterministic Finite Automata Both DFAs and NFAs are abstract machines which can be used to describe languages.
Difference between NFA and NDFA in automata?
when power feature non-determinism is added to finite automata then it is known as NDFA when an input is read the automata each step may chose to go to any of the several possible(legal) "next states " . Since the choice is not determined by anything , therefore , it is valled non deterministic.
What are components and examples of linear bounded automata?
it is an acceptor language.it bounded with both ends
Odd number of a's and even number of b's in regular expression automata?
[(aa + bb) + (ab+ba)(aa+bb)*(ab+ba)]*[a + (ab+ba)(aa+bb)*b]
Is it possible to show that all deterministic finite automata (DFA) are decidable?
Yes, it is possible to show that all deterministic finite automata (DFA) are decidable.
Are all deterministic finite automata (DFAs) also non-deterministic finite automata (NFAs)?
No, not all deterministic finite automata (DFAs) are also non-deterministic finite automata (NFAs). DFAs have a single unique transition for each input symbol, while NFAs can have multiple transitions for the same input symbol.
Is it possible to demonstrate that all deterministic finite automata (DFA) are in the complexity class P?
Yes, it is possible to demonstrate that all deterministic finite automata (DFA) are in the complexity class P.
When was Automata released?
Automata was released on 12/31/2014.
What was the Production Budget for Automata?
The Production Budget for Automata was $15,000,000.
When did Automata UK end?
Automata UK ended in 1985.
Is the main purpose of using Automata?
Is the main purpose of using Automata?
What is finite automata you-moves?
Finite automata with ε-moves, also known as epsilon transitions, are a type of finite state machine that allows transitions between states without consuming any input symbols. This means that the automaton can move from one state to another spontaneously, enabling it to represent a broader range of languages than standard finite automata. Epsilon transitions can simplify the design of automata, particularly when converting from nondeterministic finite automata (NFA) to deterministic finite automata (DFA) or when constructing automata for regular expressions.
How can you make java program to solve finite automata?
A person can make a Java program solve Finite Automata by creating a tool with Discrete. This should be done overt a network, so that all employees have access to the programming.
Who invented the automata?
the greeks
What is the difference between automata and automaton?
automata is simply plural of automaton. shantanu sharma SCRIET 2008-2012
What is full form of DFA and NFA?
DFA - deterministic finite automata NFA - non-deterministic finite automata
