Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Amaral, J.N., Turner, K. and Gosh, J., Designing genetic algorithms for the State Assignment problem, IEEE Transactions on Systems Man and Cybernetics, vol., no. 1999.
Armstrong, D.B., A programmed algorithm for assigning internal codes to sequential machines, IRE Transactions on Electronic Computers, EC 11, no. 4, pp. 466–472, August 1962.
Collaborative Benchmarking Laboratory, North Carolina State University, http: //www.cbl.ncsu.edu/pub/Benchmark_dirs/LGSynth.89/fsmexamples, November 27th. 2003.
DeJong, K. and Spears, W.M., Using genetic algorithms to solve NP-complete problems, Proceedings of the Third International Conference on Genetic Algorithms, pp. 124–132, Morgan Kaufmann, 1989.
DeJong, K. and Spears, W.M., An analysis of the interacting roles of the population size and crossover type in genetic algorithms, In Parallel problem solving from nature, pp. 38–47, Springer-Verlag, 1990.
Davis, L., Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991.
Ercegovac, M. D., Lang, T. and Moreno, J.H., Introduction to digital systems, John Wiley, 1999.
Fonseca, C.M. and Fleming, P.J., An overview of evolutionary algorithms in multi-objective optimization, Evolutionary Computation, 3(1):1–16.
Goldberg, D. E., Genetic Algorithms in Search, Optimisation and Machine Learning, Addison-Wesley, Massachusetts, Reading, MA, 1989.
Haupt, R.L. and Haupt, S.E., Practical genetic algorithms, John Wiley and Sons, 1998.
Humphrey, W.S., Switching circuits with computer applications, New York: McGraw-Hill, 1958.
Koza, J.R., Genetic Programming. MIT Press, 1992.
Michalewics, Z., Genetic algorithms + data structures = evolution program, Springer-Verlag, USA, third edition, 1996.
Nedjah, N. and Mourelle, L.M, Evolutionary state assignment for synchronous finite state machine, Proceedings of International Conference on Computational Science, Lecture Notes in Computer Science, Springer-Verlag, 2004.
Rhyne, V.T., Fundmentals of digital systems design, Computer Applications in Electrical Engineering Series, Prentice-Hall, 1973.
Villa, T. and Sangiovanni-Vincentelli, A. Nova: state assignment of finite state machine for optimal two-level logic implementation, IEEE Transactions on Computer-Aided Design, vol. 9, pp. 905–924, September 1990.
Xilinx, Project Manager, ISE 6.1i, http://www.xlinx.com.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nedjah, N., de Mourelle, L.M. (2005). Evolutionary Synthesis of Synchronous Finite State Machines. In: Nedjah, N., Mourelle, L.d.M. (eds) Evolvable Machines. Studies in Fuzziness and Soft Computing, vol 161. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32364-3_5
Download citation
DOI: https://doi.org/10.1007/3-540-32364-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22905-6
Online ISBN: 978-3-540-32364-8
eBook Packages: EngineeringEngineering (R0)