Factbites
 Where results make sense
About us   |   Why use us?   |   Reviews   |   PR   |   Contact us  

Topic: Automata theory


Related Topics

  
  Automata Theory   (Site not responding. Last check: 2007-10-19)
Automata are abstract mathematical models of machines that perform computations on an input by moving through a series of states or configurations.
Automata theory has close ties to formal language theory, since there is a correspondence between certain families of automata and classes of languages generated by grammar formalisms.
The most restricted family of automata are finite automata consisting of only a finite number of states and a "read-only" tape containing the input to be read in one direction.
www.kornai.com /MatLing/aut.html   (479 words)

  
 Automata theory   (Site not responding. Last check: 2007-10-19)
Cellular automata are but a specialized instance of the general theme of automata theory; the difference lies in the fact that automata are driven by input signals and produce output signals.
Cellular automata enjoy all the symmetries, mostly translational, inherent in their crystallographic layout; but they use the states of selected neighbors for input signals and are not generally considered to produce output.
Automata theory itself has an ancient history, if one thinks of automata as mechanisms capable of performing intricate movements; but if the actual apparatus is discarded in favor of the activity itself, such a theory more properly begins with the neurophysiological abstractions of McCulloch and Pitts.
delta.cs.cinvestav.mx /~mcintosh/newweb/lcau/node4.html   (346 words)

  
 Automata theory Summary
The primary application of automata is as symbol processors, that is, they process information presented to them as a string of symbols drawn from a fixed alphabet.
In theoretical computer science, automata theory is the study of abstract machines and problems they are able to solve.
Automata theory is closely related to formal language theory as the automata are often classified by the class of formal languages they are able to recognize.
www.bookrags.com /Automata_theory   (1964 words)

  
 Basics of Automata Theory
Through automata, computer scientists are able to understand how machines compute functions and solve problems and more importantly, what it means for a function to be defined as computable or for a question to be described as decidable.
The major objective of automata theory is to develop methods by which computer scientists can describe and analyze the dynamic behavior of discrete systems, in which signals are sampled periodically.
The families of automata above can be interpreted in a hierarchal form, where the finite-state machine is the simplest automata and the Turing machine is the most complex.
www.stanford.edu /~jcackler/automata/basics.htm   (1640 words)

  
 Cellular Automata
Cellular Automata models are capable of representing individual vehicle interactions and relating these interactions to macroscopic traffic flow metrics, such as throughput, time travel and vehicle speed.
The all-important property of cellular automata, is that this function is defined discretely (a finite lookup table).
Rule Evolution of the CA Evolutionary properties of the automata are properties that are affected by a rule.
www.theory.org /complexity/traffic   (3683 words)

  
 Finite state machine - Wikipedia, the free encyclopedia
The concept of the FSM is at the center of theory of computing, as it begins with the basic processes by which finite bits of properly encoded information could theoretically be handled intelligently by a machine.
In addition to their use in modeling reactive systems presented here, finite state automata are significant in many different areas, including electrical engineering, linguistics, computer science, philosophy, biology, mathematics, and logic.
Finite state machines are a class of automata studied in automata theory and the theory of computation.
en.wikipedia.org /wiki/Finite_state_automaton   (2049 words)

  
 Amazon.com: Automata Theory: Books: Matthew Simon   (Site not responding. Last check: 2007-10-19)
Covers substantially the central ideas of a one semester course in automata theory, oriented towards a mathematical perspective that is understandable to non-mathematicians.
Automata Theory by Matthew Simon is an unusually welcome book.
Such commentary is often omitted in books covering automata theory but is of interest to people studying Anthropological Linguistics, General (historical)Linguistics, Philosophical Linguistics, and other academic areas dealing with linguistics, but often neglected by the engineering, Computer Science and Mathematics communities.
www.amazon.com /Automata-Theory-Matthew-Simon/dp/9810237537   (1189 words)

  
 Alvy Ray Smith Cellular Automata Papers
The class of pattern sets accepted by cellular automata (CA, finite, connected subsets of cells in a 2-dimensional cellular space) is shown to be precisely the class of languages generated by the monotonic array grammars, a generalization of context-sensitive grammars to the 2-dimensional integer grid.
It was originally written as the introduction to the German edition of Theory of Self-Reproducing Automata, by John von Neumann, edited (posthumously) by Arthur W Burks, University of Illinois Press, Urbana, 1968.
A collection of n finite, identical automata are considered, where each one, at each unit time step, takes a new state as a function of the state taken at the preceding step by itself and by certain other automata in the collection, called its neighbors, arbitrarily chosen, but limited in number.
alvyray.com /Papers/PapersCA.htm   (1730 words)

  
 Cover Pages: SGML/XML and Forest/Hedge Automata Theory
As of early 1999, 'forest automata' are being referred to as 'hedge automata' in the context of SGML/XML schemas.
Schema transformation is effected by first creating intersection hedge automata which simulate the match-identifying hedge automata and the input schemata, and then transforming the intersection hedge automata as appropriate to the query operation...
The new formalism is a generalization of string automata theory, and it supports concepts such as forest regular languages, forest regular expressions and forest regular grammars.
xml.coverpages.org /hedgeAutomata.html   (4088 words)

  
 Half Century of Automata Theory   (Site not responding. Last check: 2007-10-19)
In the past half century, the theory of automata has established itself as one of the most important foundations of computer science, and its applications have spread to almost all areas of computer science as well as to other disciplines.
To celebrate the achievements in the theory of automata in the past half century and to promote further research in the area, we are organizing a one-day event at which distinguished pioneers will reminisce about the development of the theory of automata and suggest possible future directions from their personal experience and perspective.
The event, called ``Half Century of Automata Theory'', is scheduled for Wednesday, July 26, 2000 in London, Ontario, Canada, at the University of Western Ontario.
www.csd.uwo.ca /~automata   (233 words)

  
 Automata theory - Wikipedia, the free encyclopedia
This function can be extended so that instead of taking just one symbol of the alphabet, it receives a string of symbols, and returns the state in which the automaton will stay after processing the input.
Nondeterministic Finite Automata, with ε transitions (FND-ε or ε-NFA) 
Such machines are identical to DFAs (or NFAs), except that they additionally carry memory in the form of a stack.
en.wikipedia.org /wiki/Automata_theory   (910 words)

  
 Open Directory - Computers: Artificial Life: Cellular Automata
Cellular Automata and the Edge of Chaos - David J. Eck's Java-illustrated introduction to 1-dimensional cellular automata.
Cellular Automata Tutorial - A cellular automata tutorial that covers the structure, behaviour and some applications of CA and offers a philosophical background as well; by Alexander Schatten.
Introduction to Cellular automata - (game of life, brian's brain...) available in PDF, illustrated with a program (CAV) and an applet which show the capability of a conway CA to manage boolean functions as part of a Turing machine(LogiCell).
dmoz.org /Computers/Artificial_Life/Cellular_Automata   (1046 words)

  
 Amazon.ca: Computation Engineering : Applied Automata Theory and Logic: Books: Ganesh Gopalakrishnan   (Site not responding. Last check: 2007-10-19)
As a result, it is crucial that students who take automata theory and logic courses retain what they have learned and understand how to use their knowledge.
In fact, automata theory and logic evolved hand-in-hand, yet this connection was severed in the '70s as separate automata-theory and logic courses became possible.
Having used this book, students will not only know and understand automata theory, but also be able to apply their knowledge in real practice.
www.amazon.ca /Computation-Engineering-Applied-Automata-Theory/dp/0387244182   (438 words)

  
 automata theory - The relational model is to data as automata theory is to programs?
That is, there is a well-understood formal theory showing that all data can be represented and manipulated using the operands and operators of the relational model, just as there is a well-defined formal theory showing that all effective procedures can be modelled as Turing machines or Lambda calculus programs, or whatever.
Likewise, it's no slur on Turing to build a "tag soup" web browser without explicit reference to formal automata, and its no slur on Codd if one concludes that there is no direct, practical way to apply his model to applications with complex, evolving, partially-understood data requirements.
So, to echo what others have said, one could have a sensible discussion on whether a specific database application might be best approached via a pure relational model, a native XML model, or some hybrid, but arguing on the basis of pure theory or alleged universal principles seems totally pointless.
www.stylusstudio.com /xmldev/200308/post60700.html   (492 words)

  
 Automata and Formal Languages
The theory of formal languages (or automata) constitutes a cornerstone of the theoretical computer science.
Decidability questions on automata theory: The equivalence problem for multitape finite automata was shown to be decidable by T. Harju and J. Karhumäki in 1991.
Following the approach used by S. Eilenberg in his monograph Automata, Languages and Machines and W. Kuich and A. Salomaa in Semirings, Automata and Languages he has studied the D0L and their generalizations in monoids and free algebras.
vanha.math.utu.fi /research/automata/autores.html   (1022 words)

  
 Theory of Finite Automata
Undergraduate course in finite automata theory with introduction to formal languages.
The three major foundations of computer science, the mathematical description of computational networks, the limitations of mechanical computation, and the formal specification of languages are highly interrelated disciplines, and all require a great deal of mathematical maturity to appreciate.
FLAP (Formal Languages and Automata Package) a tool for designing, and simulating several variations of finite automata, and pushdown automata.
decsai.ugr.es /~jags/fat.html   (255 words)

  
 Computation, Automata, Languages
Ideal, theoretical computers are rather mathematical objects: they are, equivalently, algorithms, or effective procedures, or abstract automata, or functions which can be specified recursively, or formal languages.
Techniques for inferring automata or grammars from their languages, especially when generation is stochastic.
Theory of Finite Automata: with an Introduction to Formal Languages
cscs.umich.edu /~crshalizi/notebooks/computation.html   (915 words)

  
 Amazon.co.uk: Introduction to Automata Theory, Languages, and Computation, 2nd Ed.: Books: J.E. Hopcroft,Jeffrey D. ...   (Site not responding. Last check: 2007-10-19)
It has been more than 20 years since this classic book on formal languages, automata theory, and computational complexity was first published.
With this long-awaited revision, the authors continue to present the theory in a concise and straightforward manner, now with an eye out for the practical applications.
This is a classical textbook for last year undergraduate students or postgraduate students in computer science, especially those who are going to deal with computer languages, artificial intellegence, compiler design, computational complexity and so on.
www.amazon.co.uk /Introduction-Automata-Theory-Languages-Computation/dp/0201441241   (1671 words)

  
 Home - CIAA 2006
The CIAA conferences concern research on all aspects of implementation and application of automata and related structures, including theoretical aspects.
Automata theory is the foundation of computer science.
The purpose of this conference is to bring together members of the academic, research, and industrial community who have an interest in the theory, implementation, and application of automata and related structures.
cobra.ee.ntu.edu.tw /ciaa2006   (153 words)

  
 Cellular Automata
And I don't have to tell you that, in the physical world, general constructive automata are thin on the ground --- for the moment, anyway.
The most famous examples of this `discrete mechanics' are cellular automata, which are the discrete analogs of classical field theories, but there are also simpler systems more reminiscent of elementary classical mechanics, like a particle moving on a line --- where in this case the 'line' is the integers rather than the real numbers.
The computation proceeds by having the cellular automata organize themselves into clerks, and then a stepwise simulation of the more powerful computer is performed.
cscs.umich.edu /~crshalizi/notebooks/cellular-automata.html   (3546 words)

  
 CS 341 Automata Theory   (Site not responding. Last check: 2007-10-19)
The framework is based on the idea of a language, and problems are defined as the task of determining whether an input string is a member of some particular language.
Thus this area is often called formal language theory.
But a key idea is that all problems can be described as language recognition tasks so this framework shouldn't be thought of as limiting.
www.cs.utexas.edu /users/ear/cs341   (222 words)

  
 CS 475 | Graduate Education | Computer Science | University of Illinois at Urbana-Champaign
Finite automata and regular languages; pushdown automata and context-free languages; Turing machines and recursively enumerable sets; linear-bounded automata and context-sensitive languages; computability and the halting problem; undecidable problems; recursive functions; Chomsky hierarchy; computational complexity.
Finite automata and regular expressions: deterministic finite automata; nondeterministic finite automata; finite automata with e-moves; regular expressions; two-way finite automata; finite automata with output; applications of finite automata.
Computational complexity theory; sketch: linear speed-up, tape compression, reductions in the number of tapes, hierarchy theorems.
www.cs.uiuc.edu /graduate/courses.php?course=cs475   (272 words)

  
 Nontraditional Applications of Automata Theory - Vardi (ResearchIndex)   (Site not responding. Last check: 2007-10-19)
In the last few years, several new applications for finite-state automata have emerged, e.g., optimization of logic programs and specification and verification of protocols.
81 Generalized finite automata theory with an application to a..
23 Automata theory for database theoreticians (context) - Vardi - 1992 ACM
citeseer.ist.psu.edu /vardi94nontraditional.html   (1164 words)

  
 TDDA89 Formal Languages and Automata Theory
Automata and formal languages appear (possibly in various disguises) in almost every branch of computer science.
A formal language is a set of strings where a string is a finite sequence of symbols.
Slides "From finite automata to regular expressions" [PDF], [PS, 2 per page].
www.ida.liu.se /~TDDA89   (765 words)

Try your search on: Qwika (all wikis)

Factbites
  About us   |   Why use us?   |   Reviews   |   Press   |   Contact us  
Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.