3 Finite Automata

[1]  Ernst L. Leiss,et al.  On Equations for Regular Languages, Finite Automata, and Sequential Networks , 1980, Theor. Comput. Sci..

[2]  Sheng Yu,et al.  Minimal cover-automata for finite languages , 2001, Theor. Comput. Sci..

[3]  George H. Mealy,et al.  A method for synthesizing sequential circuits , 1955 .

[4]  R.W. Hyndman,et al.  Digital networks , 1977, Proceedings of the IEEE.

[5]  Katsushi Inoue,et al.  A Note on Alternating On-Line Turing Machines , 1982, Inf. Process. Lett..

[6]  Arto Salomaa.  Jewels of formal language theory , 1981 .

[7]  Lotfi A. Zadeh,et al.  Note on fuzzy languages , 1969, Inf. Sci..

[8]  Sheng Yu,et al.  Synchronization expressions and languages , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[9]  Ernst L. Leiss,et al.  On Generalized Language Equations , 1981, Theor. Comput. Sci..

[10]  Derick Wood,et al.  Theory of computation , 1986 .

[11]  David Harel,et al.  On the power of bounded concurrency II: pushdown automata , 1994, JACM.

[12]  Arto Salomaa,et al.  Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model , 1996 .

[13]  Doron Drusinsky,et al.  On the power of bounded concurrency I: finite automata , 1994, JACM.

[14]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[15]  Rusins Freivalds,et al.  Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata , 1991, ICALP.

[16]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[17]  Jarkko Kari,et al.  Image compression using weighted finite automata , 1993, Comput. Graph..

[18]  Edward F. Moore,et al.  Gedanken-Experiments on Sequential Machines , 1956 .

[19]  Oscar Nierstrasz,et al.  Regular types for active objects , 1993, OOPSLA '93.

[20]  Ernst L. Leiss,et al.  Unrestricted Complementation in Language Equations Over a One-Letter Alphabet , 1994, Theor. Comput. Sci..

[21]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[22]  Dexter Kozen,et al.  On parallelism in turing machines , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[23]  Oscar H. Ibarra,et al.  Some Observations Concerning Alternating Turing Machines Using Small Space , 1987, Inf. Process. Lett..

[24]  Walter L. Ruzzo,et al.  Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..

[25]  Katsushi Inoue,et al.  Two-dimensional alternating Turing machines , 1982, STOC '82.

[26]  Tero Harju,et al.  Splicing semigroups of dominoes and DNA , 1991, Discret. Appl. Math..

[27]  Sheng Yu,et al.  The State Complexities of Some Basic Operations on Regular Languages , 1994, Theor. Comput. Sci..

[28]  Sheng Yu,et al.  On the state complexity of intersection of regular languages , 1991, SIGA.

[29]  R. McNaughton,et al.  Counter-Free Automata , 1971 .

[30]  Namio Honda,et al.  Fuzzy Events Realized by Finite Probabilistic Automata , 1968, Inf. Control..

[31]  Ernst L. Leiss,et al.  Succint Representation of Regular Languages by Boolean Automata , 1981, Theor. Comput. Sci..

[32]  T. Head.  Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. , 1987, Bulletin of mathematical biology.

[33]  Jorge Stolfi,et al.  Two methods for generating fractals , 1989, Comput. Graph..

[34]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[35]  Sheng Yu,et al.  Constructions for alternating finite automata , 1990, Int. J. Comput. Math..

[36]  Jun'ichi Toyoda,et al.  Various Kinds of Automata with Weights , 1975, J. Comput. Syst. Sci..

[37]  K. Salomaa,et al.  Efficient Implementation of Regular Languages Using R-AFA , 1997, Workshop on Implementing Automata.

[38]  Peter A. Lindsay,et al.  Alternation and omega-Type Turing Acceptors , 1986, Theor. Comput. Sci..

[39]  Frederick C. Hennie,et al.  Finite-state Models for Logical Machines , 1968 .

[40]  I. N. Sneddon,et al.  Theory Of Automata , 1969 .

[41]  W. Pitts,et al.  A Logical Calculus of the Ideas Immanent in Nervous Activity (1943) , 2021, Ideas That Created the Future.

[42]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[43]  Karel Culik,et al.  Affine automata and related techniques for generation of complex images , 1993, Theor. Comput. Sci..

[44]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[45]  Ernst L. Leiss,et al.  Language Equations Over a One-Letter Alphabet with Union, Concatenation and Star: A Complete Solution , 1994, Theor. Comput. Sci..

[46]  Wolfgang J. Paul,et al.  On alternation , 1980, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[47]  Eugene S. Santos.  Realizations of fuzzy languages by probabilistic, max-product, and maximin automata , 1975, Inf. Sci..

[48]  Abdelaziz Fellah.  Alternating finite automata and related problems , 1992 .