Linear realization of finite automata
نویسندگان
چکیده
منابع مشابه
Linear Cellular Automata and Finite Automata
Linear cellular automata have a canonical representation in terms of labeled de Bruijn graphs. We will show that these graphs, construed as semiautomata, provide a natural setting for the study of cellular automata. For example, we give a simple algorithm to determine reversibility and surjectivity of the global maps. We also comment on Wolfram’s question about the growth rates of the minimal f...
متن کاملLinear Encoding Scheme for Weighted Finite Automata
In this paper, we show that the linear encoding scheme efficiently implements weighted finite automata (WFA). WFA with t transitions can be hardwired with O(t) cells. They solve pattern matching problems in a pipelined way, parsing one character every clock cycle. With the massive parallelism of reconfigurable processors like FPGAs, a significant speed-up is obtained against software solutions.
متن کاملFinite Dynamical Systems, Linear Automata, and Finite Fields
We establish a connection between finite fields and finite dynam-ical systems. We show how this connection can be used to shed light on some problems in finite dynamical systems and in particular, in linear systems.
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملRealization of Stochastic Automata HASSAN
Using the convex combination of random binary variables, stochastic vectors and stochastic matrices are systematically realized. The techniques are extended to the realization of stochastic automata as randomly fed deterministic automata. Conditions for stochastic state equivalence are analyzed to uncover the connection with deterministic state equivalence. State minimality of both the stochast...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1977
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(77)80003-2