Abstract
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.
We define the model of deterministic generalized automaton (DGA) and study the problem of its minimization. A DGA has the restriction that, for each state, the sets of words corresponding to the transitions of that state are prefix sets. We solve the problem of calculating the number of states of a minimal DGA for a given language, by giving a procedure that effectively constructs it starting from the minimal (conventional) deterministic automaton.
Work partially supported by the ESPRIT II Basic Research Actions Program of the EC under Project ASMICS 2 (contract No. 6317) and in part by MURST under project 40% Algoritmi, Modelli di Calcolo, Strutture Informative.
Partially supported by a research fellowship by (INdAM).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Aho, J. E. Hopcroft and J. D. Ullman. The Design and the Analysis of Computer Algorithm. Addison-Wesley, Reading, MA 1974.
J. Berstel and D. Perrin Theory of Codes Academic Press, 1985.
S. Eilenberg. Automata, Languages and Machines Vol. A, Academic Press, 1974.
N. Globerman and D. Harel. Complexity results for multi-pebble automata and their logics. In Proc. (ICALP'94). S. Abiteboul and E. Shamir Eds. Springer-Verlag, n. 820, pp. 73–82 (1994).
K. Hashigushi. Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language. In Proc. (ICALP'91). J. Leach Albert et al. Eds. Springer-Verlag, n. 510, pp. 641–648 (1991).
J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, MA 1979.
Tao Jiang and B. Ravikumar. Minimal NFA problems are hard. In Proc. (ICALP'91). J. Leach Albert et al. Eds. Springer-Verlag, n. 510, pp. 629–640 (1991).
J. M. Lewis and M. Yannakakis. The node-deletion problem for hereditary properties is NP-complete. Journal of Comp. and System Science, 20, pp. 219–230 (1980).
D. Perrin. Finite Automata. In Handbook of Theoretical Computer Science. J. Van Leeuwen ed. Elsevier, Vol. B, pp. 1–57, 1990.
A. Weber and R. Klemm. Economy of description for single-valued transducers. In Proc. (STACS'94). P. Enjalbert et al. Eds. Springer-Verlag, n. 775, pp. 607–618 (1994).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giammarresi, D., Montalbano, R. (1995). Deterministic generalized automata. In: Mayr, E.W., Puech, C. (eds) STACS 95. STACS 1995. Lecture Notes in Computer Science, vol 900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_84
Download citation
DOI: https://doi.org/10.1007/3-540-59042-0_84
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59042-2
Online ISBN: 978-3-540-49175-0
eBook Packages: Springer Book Archive