Abstract
Champarnaud [1] analyzed the number of states obtained from a binary ⊕-NFA during the subset construction. We extend this work to an experimental analysis of the size of the minimal DFAs obtained from binary ⊕-NFAs.We then consider the number of distinct languages accepted by binary ⊕-NFAs, and compare that to Domaratzki’s results [2] for (traditional) binary NFAs. We also show that there are certain regular languages which are accepted by succinct ⊕-NFAs, but for which no succinct traditional NFA exists.
This research was supported by NRF grant #2053436.
This is a preview of subscription content, log in via an institution to check access.
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
Champarnaud, J., Hansel, G., Paranthoën, T., Ziadi, D.: NFAs bitstream-based random generation. In: Proceedings of the 4th Workshop on the Descriptional Complexity of Formal Systems, London, Ontario, Canada (2002)
Domaratzki, M., Kisman, D., Shallit, J.: On the number of distinct languages accepted by finite automata with n states. Journal of Automata, Languages and Combinatorics 7 (2002) 469–486
Meyer, A., Fischer, M.: Economy of description by automata, grammars, and formal systems. In: Proceedings of the 12th Annual IEEE Symposium on Switching and Automata Theory, Michigan, IEEE (1971) 188–191
van Zijl, L.: Nondeterminism and succinctly representable regular languages. In: Proceedings of SAICSIT’2002. ACM International Conference Proceedings Series, Port Elizabeth, South Africa (2002) 212–223
Golomb, S.: Shift Register Sequences. Holden-Day, Inc. (1967)
van Zijl, L.: Random number generation with ⊕-NFAs. In: Proceedings of the CIAA 2001. Volume 2494 of Lecture Notes in Computer Science., Pretoria, South Africa (2002) 263–273
Chaudhuri, P., Chowdhury, D., Nandi, S., Chattaopadhyay, S.: Additive Cellular Automata: Theory and Applications. Volume 1. IEEE Computer Society Press, Los Alamitos, California (1997)
Sipser, M.: Introduction to the Theory of Computation. PWS Publishing Company, Boston (1997)
van Zijl, L.: Generalized Nondeterminism and the Succinct Representation of Regular Languages. PhD thesis, University of Stellenbosch, South Africa (1997)
Dornhoff, L., Hohn, F.: Applied Modern Algebra. MacMillan Publishing Co., Inc., New York (1977)
Stone, H.: Discrete Mathematical Structures and their Applications. Computer Science Series. Science Research Associates, Inc., Chicago (1973)
van Zijl, L., Harper, J. P., Olivier, F.: The MERLin environment applied to ⋆-NFAs. In: Proceedings of the CIAA2000. Volume 2088 of Lecture Notes in Computer Science., London, Ontario, Canada (2001) 318–326
Raymond, D., Wood, D.: The user’s guide to Grail. Technical report, University of Waterloo, Waterloo, Canada (1995)
Chrobak, M.: Finite automata and unary languages. Theoretical Computer Science (1986) 149–158
Leiss, E.: Succinct representation of regular languages by boolean automata. Theoretical Computer Science 13 (1981) 323–330
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Zijl, L. (2003). Succinct Descriptions of Regular Languages with Binary ⊕-NFAs. In: Ibarra, O.H., Dang, Z. (eds) Implementation and Application of Automata. CIAA 2003. Lecture Notes in Computer Science, vol 2759. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45089-0_8
Download citation
DOI: https://doi.org/10.1007/3-540-45089-0_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40561-0
Online ISBN: 978-3-540-45089-4
eBook Packages: Springer Book Archive