Abstract
We explore expression automata with respect to determinism, minimization and primeness. We define determinism of expression automata using prefix-freeness. This approach is, to some extent, similar to that of Giammarresi and Montalbano’s definition of deterministic generalized automata. We prove that deterministic expression automata languages are a proper subfamily of the regular languages. We define the minimization of deterministic expression automata. Lastly, we discuss prime prefix-free regular languages.
Note that we have omitted almost all proofs in this preliminary version.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brzozowski, J., McCluskey Jr., E.: Signal flow graph techniques for sequential circuit state diagrams. IEEE Transactions on Electronic Computers EC-12, 67–76 (1963)
Czyzowicz, J., Fraczak, W., Pelc, A., Rytter, W.: Linear-time prime decomposition of regular prefix codes. International Journal of Foundations of Computer Science 14, 1019–1032 (2003)
Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press, New York (1974)
Giammarresi, D., Montalbano, R.: Deterministic generalized automata. Theoretical Comput. Sci. 215, 191–208 (1999)
Hopcroft, J.: An n log n algorithm for minimizing the states in a finite automaton. In: Kohavi, Z., Paz, A. (eds.) Theory of Machines and Computations, pp. 189–196. Academic Press, New York
Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (1979)
Mateescu, A., Salomaa, A., Yu, S.: Factorizations of languages and commutativity conditions. Acta Cybernetica 15(3), 339–351 (2002)
Moore, E.: Gedanken experiments on sequential machines. In: Shannon, C., McCarthy, J. (eds.) Automata Studies, pp. 129–153. Princeton University Press, Princeton (1956)
Perrin, D.: Finite automata. In: van Leeuwen, J. (ed.) Formal Models and Semantics. Handbook of Theoretical Computer Science, vol. B, pp. 1–57. The MIT Press, Cambridge (1990)
Salomaa, A., Yu, S.: On the decomposition of finite languages. In: Rozenberg, G., Thomas, W. (eds.) Developments in Language Theory (DLT 1999), pp. 22–31. World Scientific, Singapore (2000)
Stockmeyer, L., Meyer, A.: Word problems requiring exponential time. In: Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, pp. 1–9 (1973)
Wood, D.: Theory of Computation. John Wiley & Sons, Inc., New York (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, YS., Wood, D. (2005). The Generalization of Generalized Automata: Expression Automata. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds) Implementation and Application of Automata. CIAA 2004. Lecture Notes in Computer Science, vol 3317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30500-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-30500-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24318-2
Online ISBN: 978-3-540-30500-2
eBook Packages: Computer ScienceComputer Science (R0)