scispace - formally typeset
Search or ask a question
Topic

Automata theory

About: Automata theory is a research topic. Over the lifetime, 5162 publications have been published within this topic receiving 175855 citations.


Papers
More filters
Book
01 Jan 1979
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Abstract: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity. The authors present the theory in a concise and straightforward manner, with an eye out for the practical applications. Exercises at the end of each chapter, including some that have been solved, help readers confirm and enhance their understanding of the material. This book is appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.

13,779 citations

Journal ArticleDOI
TL;DR: Alur et al. as discussed by the authors proposed timed automata to model the behavior of real-time systems over time, and showed that the universality problem and the language inclusion problem are solvable only for the deterministic automata: both problems are undecidable (II i-hard) in the non-deterministic case and PSPACE-complete in deterministic case.

7,096 citations

Book
30 Sep 1999
TL;DR: This edition includes recent research results pertaining to the diagnosis of discrete event systems, decentralized supervisory control, and interval-based timed automata and hybrid automata models.
Abstract: Introduction to Discrete Event Systems is a comprehensive introduction to the field of discrete event systems, offering a breadth of coverage that makes the material accessible to readers of varied backgrounds. The book emphasizes a unified modeling framework that transcends specific application areas, linking the following topics in a coherent manner: language and automata theory, supervisory control, Petri net theory, Markov chains and queuing theory, discrete-event simulation, and concurrent estimation techniques. This edition includes recent research results pertaining to the diagnosis of discrete event systems, decentralized supervisory control, and interval-based timed automata and hybrid automata models.

4,330 citations

Journal ArticleDOI
TL;DR: Analysis is given of ''elementary'' cellular automata consisting of a sequence of sites with values 0 or 1 on a line, with each site evolving deterministically in discrete time steps according to p definite rules involving the values of its nearest neighbors.
Abstract: Cellular automata are used as simple mathematical models to investigate self-organization in statistical mechanics. A detailed analysis is given of "elementary" cellular automata consisting of a sequence of sites with values 0 or 1 on a line, with each site evolving deterministically in discrete time steps according to definite rules involving the values of its nearest neighbors. With simple initial configurations, the cellular automata either tend to homogeneous states, or generate self-similar patterns with fractal dimensions \ensuremath{\simeq} 1.59 or \ensuremath{\simeq} 1.69. With "random" initial configurations, the irreversible character of the cellular automaton evolution leads to several self-organization phenomena. Statistical properties of the structures generated are found to lie in two universality classes, independent of the details of the initial state or the cellular automaton rules. More complicated cellular automata are briefly considered, and connections with dynamical systems theory and the formal theory of computation are discussed.

2,860 citations

Journal ArticleDOI
01 Jan 1989
TL;DR: The focus is on the qualitative aspects of control, but computation and the related issue of computational complexity are also considered.
Abstract: A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Such systems arise in a variety of contexts ranging from computer operating systems to the control of complex multimode processes. A control theory for the logical aspects of such DESs is surveyed. The focus is on the qualitative aspects of control, but computation and the related issue of computational complexity are also considered. Automata and formal language models for DESs are surveyed. >

2,829 citations


Network Information
Related Topics (5)
Time complexity
36K papers, 879.5K citations
88% related
Data structure
28.1K papers, 608.6K citations
88% related
Approximation algorithm
23.9K papers, 654.3K citations
84% related
Computational complexity theory
30.8K papers, 711.2K citations
84% related
Distributed algorithm
20.4K papers, 548.1K citations
84% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20237
202213
202133
202059
201951
201864