# automata in theory

** The complexity of decision problems in automata theory and logic.**

free download

The inherent computational complexity of a variety of decision problems in mathematical logic and the theory of automata is analyzed in terms of Turing machine time and space and in terms of the comp1exity of Boolean networks. The problem of deciding whether a star-free

** A second course in formal languages and automata theory **

free download

This is a textbook for a second course on formal languages and automata theory . Many undergraduates in computer science take a course entitled Introduction to Theory of Computing, in which they learn the basics of finite automata , pushdown automata , context

** Theory and applications of nonlinear cellular automata in VLSI design**

free download

Abstract In recent years, Cellular Automata (CA) have been found as an attractive modeling tool for various applications, such as, pattern recognition, image processing, data compression, encryption and specially V LSI design test. However, for all such

** Realization theory for automata in categories**

free download

This paper solves a problem of Arbib and Manes from the categorial automata theory : for which input processes F: K ~ K do minimal realizations always exist A generalization is exhibited, giving a model of finite automata and treating all functors, not only inputINTRODUCTION The concept of isolated cut-points plays a foundarnental role in the theory of probabilistic autornata. The following problern, suggested by ( 1 J and by [~] is qui te natural: (1) Can one device an algorithm to decide, for every given probabil_! stic autornaton The study of Process Algebra has received a great deal of attention since the pioneering work in the 1970s of the likes of R. Milner and CAR Hoare. This attention has been merited as the formalism provides a natural framework for describing and analysing systemsPage 1. FUZZY MORP~ISHMS IN AUTOMATA THEORY 1 M_.A. Arbib Computer and Information Science E~G, Manes Mathematics University of Massachusetts Amherst, MA 01002 USA A function f : A ) B generalizes to a fuzzy function F : A ~ B in a number of ways. F can be a partial function

** Uniformization in automata theory **

free download

We survey some classical results on uniformizations of automaton definable relations by automaton definable functions. We consider the case of automatic relations over finite and infinite words and trees as well as rational relations over finite and infinite words. We also

** Real-time and complexity problems in automata theory **

free download

In recursive function theory , which provides an adequate basis for the description of constructive objects as well as of algorithmic processes occurring in mathematical logic and in the theory of deterministic digital computers, the attention was for a long time concentrated

** On minimal realizations of behavior maps in categorial automata theory **

free download

The note has three parts* In I, we give a sufficient condition for the existence of minimal realizations in 2tym,(T), F*% *, X(see [33) In II, we apply it to the case% as QZ and solve fully this situation* In III, we give a very simple sufficient condition for the existence of free F

** The role of finite automata in the development of modern computing theory **

free download

Absfract: Regular patterns described by finite automata are evident in the behavior of computers, in the structure of programming languages and in the rules for reasoning about programs. The systematic study of these patterns has shaped computing theory , providing

** Finite element simulation of martensitic transformation in single-crystal TRIP steel based on crystal plasticity theory with cellular automata approach**

free download

1Graduate School of Engineering, Hiroshima University, Kagamiyama, Higashi-Hiroshima, Hiroshima, 739 8527 Japan 2Faculty of Health Science, Hiroshima International University, Gakuendai, Kurose, Hiroshima, 724-0695 Japan aiwamoto@mec.hiroshima-u.ac.jp, b

** Some descriptional complexity problems in finite automata theory **

free download

Automata Theory is one of the oldest and well studied areas in theoretical computer science. Almost all not very hard problems, yet of main interest have been solved. The exciting developments in theoretical computer science for more than two decades ago produced

** Open problems in automata theory : an idiosyncratic view**

free download

Jeffrey Shallit School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1 Canada shallit@cs.uwaterloo.ca http://www.cs.uwaterloo.ca/~shallit 1. The separating words problem 2. Buchers problem on separating context-free languages 3. Nonzero Hankel determinants

** Minimal realizations for finite sets in categorial automata theory **

free download

Page 1. Commentationes Mathematicae Universitatis Carolinae VÄ›ra Trnková Minimal realizations for finite sets in categorial automata theory Commentationes Mathematicae Universitatis Carolinae, Vol. 16 (1975), No. 21 35 Persistent URL: http://dml.cz/dmlcz/105603 Terms of use Math .Univ

** On some problems in the theory of partial automata **

free download

The theory of automata is closely connected with the theory of semigroups (or, to be more exact, with the theory of representations of semigroups by transformations). The concept of automaton without outputs is equivalent to the concept of representa tion of free semigroup

** Parallelization of Concurrent Processes in Higher Dimensional Automata ( Theory of Rewriting Systems and Its Applications)**

free download

In many process algebras, a nondeterministic choice in particular $mathrm {f}mathrm {o}mathrm {r}ln $ can be translated to a parallel composition with the expansion law. This translation, $mathrm {w}mathrm {h}mathrm {i}mathrm {c} 1_ {1} $ we will call par

** Modeling Timed Automata Theory in PVS.**

free download

Verification of Timed Automata ) for specifying and reasoning about real-time systems using TA (Timed Automata ) theory in PVS (Prototype Verification System) is proposed in this paper. This system includes two parts: one for modeling real-time system using TA template This thesis is devoted to the study of problems of automata theory from the point of view of descriptive set theory . The analyzed structures are x-words and infinite trees. Most of the results presented here have the form of an effective decision procedure that operates on

** Introducing real time in the algebraic theory of finite automata **

free download

Working Papers are interim reports on work of the International Institute for Applied Systems Analysis and have received only limited review. Views or opinions expressed herein do not necessarily repre- sent those of the Institute or of its National Member Organizations INTERNATIONAL

FREE IEEE PAPER