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 ChapterDOI
01 Jun 2008
TL;DR: Some elements are presented of a forthcoming textbook on automata theory and formal languages, that puts more emphasis on equational reasoning, and some advantages of such an approach are discussed.
Abstract: Some elements are presented of a forthcoming textbook on automata theory and formal languages, that puts more emphasis on equational reasoning. Some advantages of such an approach are discussed. This paper is dedicated to Ugo Montanari, who has contributed such a lot to concurrency theory and the theory of computational models.
Proceedings ArticleDOI
14 Oct 2008
TL;DR: All kinds of nonfunctional trustworthiness properties of composite components in real-time reactive systems (RTRS) can be verified based on the CRG using a SAT solver using the constructing algorithm presented.
Abstract: Timed component interface control flow automata (TCICFA) is presented to specify and verify composite real-time components' invocation behavior and timing constraint information. By analyzing TCICFAs, a component reachability graph (CRG) can be constructed based on the constructing algorithm we presented. Each node in CRG is equipped with a state formula which has been computed with the construction of the CRG, and assertions can be made at each node to express safety, real-time liveness and other trustworthiness properties. Then all kinds of nonfunctional trustworthiness properties of composite components in real-time reactive systems (RTRS) can be verified based on the CRG using a SAT solver.
Proceedings ArticleDOI
Takao Namiki1
04 Dec 2013
TL;DR: The author shows that ℤ2-action with a two-dimensional cellular automaton map and a shift has finite entropy, which means that the entropy of two symbol nearest neighbor per mutative two- dimensional cellular automata does not work well for two- dimension automata.
Abstract: In the present paper the author discusses entropy of two symbol nearest neighbor per mutative two-dimensional cellular automata. Entropy of dynamical system is perfect invariant for the weak Bernoulli class, which means that if the entropy has the same value for two dynamical systems there exists a conjugacy between them. On the other hand, the value of entropy of two-dimensional cellular automata is infinite or zero in general. This means that the entropy does not work well for two-dimensional cellular automata. To avoid the problem, the author show that ℤ2-action with a two-dimensional cellular automaton map and a shift has finite entropy.
Journal ArticleDOI
TL;DR: The optical implementation of the elementary cellular automaton based on a two-layer chip architecture is reported and all 256 Cellular automaton local rules can be performed by programming the transparency of a SLM mask.
Abstract: The optical implementation of the elementary cellular automaton based on a two-layer chip architecture is reported. All 256 cellular automaton local rules can be performed by programming the transparency of a SLM mask. Simulations and experimental results are also given. © 1992 John Wiley & Sons, Inc.
Journal Article
TL;DR: The concept of an observation graph of an automaton is introduced which is used as the main tool for the design of an algorithm which tests, in a uniform manner, two types of complementarity properties.
Abstract: Studies of computational complementarity properties in finite state interactive automata may shed light on the nature of both quantum and classical computation. But, complementarity is difficult to test even for small-size automata. This paper introduces the concept of an observation graph of an automaton which is used as the main tool for the design of an algorithm which tests, in a uniform manner, two types of complementarity properties. Implementations have been run on a standard desktop computer examining all 5-state binary automata.

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