Magic numbers for symmetric difference NFAS

International Journal of Foundations of Computer Science

Volumn 16, Issue 5, 2005, Pages 1027-1038

  Van Zijl, Lynette ^a  

^a STELLENBOSCH UNIVERSITY   (South Africa)

Author keywords

Automata; Nondeterminism; Succinctness

Indexed keywords

EID: 33746228530     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054105003455     Document Type: Article

References (15)

1. Champarnaud, J.-M., Hansel, G., Paranthoën, T., Ziadi, D., NFAs Bitstream-based Random Generation, in Proceedings of the 4th Conference on Descriptional Complexity of Formal Systems, (London, Ontario, Canada 2002).
2. Chaudhuri, P.P., Chowdhury, D.R., Nandi, S., Chattaopadhyay, S., Additive Cellular Automata Theory and Applications Volume 1, (IEEE Computer Society Press, Los Alamitos, California, 1997).
3. 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 (4) (2002) 469-486.
4. Dornhoff, L.L., Hohn, P.E., Applied Modern Algebra, (MacMillan Publishing Co., Inc., New York, 1977).
5. Golomb, S.W., Shift Register Sequences, (Holden-Day, Inc., 1967).
6. Iwama, K., Kambayashi, Y., Takaki, K., Tight Bounds on the Number of States of DFAs that are Equivalent to n-state NFAs. Theoretical Computer Science 237 (2000) 485-494.
7. n - α Deterministic States. Theoretical Computer Science 301 (2003) 451-462.
8. Jiraskova, G., Note on Minimal Finite Automata, in Proceedings of the 26th Symposium on the Mathematical Foundations of Computer Science 2001, Lecture Notes in Computer Science 2136 (2001), pp. 421-431.
9. Meyer, A.R., Fisher, M.J., Economy of Description by Automata, Grammars and Formal Systems, in Proceedings of the 12th Annual IEEE Symposium on Switching and Automata Theory (1971) (Michigan) pp. 188-191.
10. Nicaud, C., Average State Complexity of Operations on Unary Automata, in Proceedings of the 24th Symposium on the Mathematical Foundations of Computer Science 1999, Lecture Notes in Computer Science 1672 (1999), pp. 231-240.
11. Sipser, M., Introduction to the Theory of Computation, (PWS Publishing Company, 1997).
12. Stone, H., Discrete Mathematical Structures, (Science Research Associates, Chicago, 1973).
13. Van Zijl, L., Random Number Generation with Symmetric Difference NFAs, in Proceedings of CIAA2001, Lecture Notes in Computer Science 2494 (2002), pp. 263-273.
14. Van Zijl, L., Nondeterminism and Succinctly Representable Regular Languages, in Proceedings of SAICSIT'2002, ACM International Conference Proceedings Series (2002), pp. 212-223.
15. Van Zijl, L., On Binary Symmetric Difference NFAs and Succinct Descriptions of Regular Languages, Theoretical Computer Science 328 (2004) 161-170.