Deterministic Generalized Automata

A generalized automaton (GA) is a finite automaton where the single transitions are defined on words rather than on single letters. Generalized automata were considered by K. Hashiguchi who proved that the problem of calculating the size of a minimal GA is decidable.

[1]  Reinhard Klemm,et al.  Economy of Description for Single-Valued Transducers , 1994, Inf. Comput..

[2]  Mehryar Mohri.  Minimization of Sequential Transducers , 1994, CPM.

[3]  Umberto Eco,et al.  Theory of Codes , 1976 .

[4]  Derick Wood,et al.  Deterministic Regular Languages , 1991, STACS.

[5]  Tao Jiang,et al.  Minimal NFA Problems are Hard , 1991, SIAM J. Comput..

[6]  Tao Jiang,et al.  The Structure and Complexity of Minimal NFA's over a Unary Alphabet , 1991, FSTTCS.

[7]  David Harel,et al.  Complexity Results for Multi-Pebble Automata and their Logics , 1994, ICALP.

[8]  Dominique Perrin,et al.  Finite Automata , 1958, Philosophy.

[9]  Marek Chrobak,et al.  Finite Automata and Unary Languages , 1986, Theor. Comput. Sci..

[10]  Dora Giammarresi,et al.  Deterministic Generalized Automata , 1995, STACS.

[11]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[12]  Carl A. Gunter,et al.  In handbook of theoretical computer science , 1990 .

[13]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

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

[15]  John M. Lewis,et al.  The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..

[16]  Tao Jiang,et al.  The Structure and Complexity of Minimal NFA's over a Unary Alphabet , 1991, Int. J. Found. Comput. Sci..

[17]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[18]  Kosaburo Hashiguchi.  Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language , 1991, ICALP.