Internet Protocol - Research by Kirils Solovjovs

Finite-state machine 116
• Davis, Martin; Ron Sigal, Elaine J. Weyuker (1994). Computability, Complexity, and Languages and Logic:
Fundamentals of Theoretical Computer Science (2nd ed.). San Diego: Academic Press, Harcourt, Brace &
Company. ISBN 0-12-206382-1.
• Hopcroft, John; Jeffrey Ullman (1979). Introduction to Automata Theory, Languages, and Computation (1st ed.).
Reading Mass: Addison-Wesley. ISBN 0-201-02988-X.
• Hopcroft, John E.; Rajeev Motwani, Jeffrey D. Ullman (2001). Introduction to Automata Theory, Languages, and
Computation (2nd ed.). Reading Mass: Addison-Wesley. ISBN 0-201-44124-1.
• Hopkin, David; Barbara Moss (1976). Automata. New York: Elsevier North-Holland. ISBN 0-444-00249-9.
• Kozen, Dexter C. (1997). Automata and Computability (1st ed.). New York: Springer-Verlag.
ISBN 0-387-94907-0.
• Lewis, Harry R.; Christos H. Papadimitriou (1998). Elements of the Theory of Computation (2nd ed.). Upper
Saddle River, New Jersey: Prentice-Hall. ISBN 0-13-262478-8.
• Linz, Peter (2006). Formal Languages and Automata (4th ed.). Sudbury, MA: Jones and Bartlett.
ISBN 978-0-7637-3798-6.
• Minsky, Marvin (1967). Computation: Finite and Infinite Machines (1st ed.). New Jersey: Prentice-Hall.
• Christos Papadimitriou (1993). Computational Complexity (1st ed.). Addison Wesley. ISBN 0-201-53082-1.
• Pippenger, Nicholas (1997). Theories of Computability (1st ed.). Cambridge, England: Cambridge University
Press. ISBN 0-521-55380-6 (hc).
• Rodger, Susan; Thomas Finley (2006). JFLAP: An Interactive Formal Languages and Automata Package (1st
ed.). Sudbury, MA: Jones and Bartlett. ISBN 0-7637-3834-4.
• Sipser, Michael (2006). Introduction to the Theory of Computation (2nd ed.). Boston Mass: Thomson Course
Technology. ISBN 0-534-95097-3.
• Wood, Derick (1987). Theory of Computation (1st ed.). New York: Harper & Row, Publishers, Inc..
ISBN 0-06-047208-1.
Abstract state machines in theoretical computer science
• Yuri Gurevich (2000), Sequential Abstract State Machines Capture Sequential Algorithms, ACM Transactions on
Computational Logic, vl. 1, no. 1 (July 2000), pages 77–111. http:/ / research. microsoft. com/ ~gurevich/ Opera/
141. pdf
Machine learning using finite-state algorithms
• Mitchell, Tom M. (1997). Machine Learning (1st ed.). New York: WCB/McGraw-Hill Corporation.
ISBN 0-07-042807-7.
Hardware engineering: state minimization and synthesis of sequential circuits
• Booth, Taylor L. (1967). Sequential Machines and Automata Theory (1st ed.). New York: John Wiley and Sons,
Inc.. Library of Congress Card Catalog Number 67-25924.
• Booth, Taylor L. (1971). Digital Networks and Computer Systems (1st ed.). New York: John Wiley and Sons,
Inc.. ISBN 0-471-08840-4.
• McCluskey, E. J. (1965). Introduction to the Theory of Switching Circuits (1st ed.). New York: McGraw-Hill
Book Company, Inc.. Library of Congress Card Catalog Number 65-17394.
• Hill, Fredrick J.; Gerald R. Peterson (1965). Introduction to the Theory of Switching Circuits (1st ed.). New York:
McGraw-Hill Book Company. Library of Congress Card Catalog Number 65-17394.