论文信息 - Deterministic Generalized Automata

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.

Dora Giammarresi | Rosa Montalbano

[1] Tao Jiang,et al. Minimal NFA Problems Are Hard , 1991, ICALP.

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

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

[4] J. Berstel,et al. Theory of codes , 1985 .

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

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

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

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

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