Computer Science

Johannsen, Jan Johannsen, Jan- University of München. Homer, Steve Homer, Steve- Boston University. Hitchcock, John Hitchcock, John- University of Wyoming. Hirsch, Edward Hirsch, Edward- Steklov Institute of Mathematics at St.Petersburg. Hermann, Miki Hermann, Miki- National Center for Scientific Research (France). Hemaspaandra, Lane Hemaspaandra, Lane- University of Rochester. Håstad, Johan Håstad, Johan- Kungliga Tekniska högskolan. Hajiaghayi, Mohammad Taghi Hajiaghayi, Mohammad Taghi- Massachusetts Institute of Technology. Grigni, Michelangelo Grigni, Michelangelo- Emory University. Green, Frederic Green, Frederic- Clark University. Gal, Anna Gal, Anna- University of Texas at Austin. Fagin, Ronald Fagin, Ronald- IBM Almaden Research Center. Furer, Martin Furer, Martin- Pennsylvania State University. Dantsin, Evgeny Dantsin, Evgeny- Roosevelt University. Czumaj, Artur Czumaj, Artur- University of Paderborn. Chen, Jianer Chen, Jianer- Texas A&M University. Chazelle, Bernard Chazelle, Bernard- Princeton University. Chang, Richard Chang, Richard- University of Maryland. Calude, Cristian Calude, Cristian- University of Auckland. Buss, Samuel Buss, Samuel- University of California, San Diego. Bollig, Beate Bollig, Beate- University of Dortmund. Ben-Or, Michael Ben-Or, Michael- The Hebrew University. Bellare, Mihir Bellare, Mihir- University of California, San Diego. Beame, Paul Beame, Paul- University of Washington. Arora, Sanjeev Arora, Sanjeev- Princeton University. Allender, Eric Allender, Eric- Rutgers, the State University of NJ. Sudan, Madhu Sudan, Madhu- Massachusetts Institute of Technology. Spielman, Daniel A. Spielman, Daniel A.- Professor of Applied Mathematics and Computer Science at Yale. Papadimitriou, Christos H. Papadimitriou, Christos H.- Author of the very popular book on complexity theory. Home page with recent publications and links to courses. Jerrum, Mark Jerrum, Mark- University of Edinburgh. Chen, Hubie Chen, Hubie- Cornell University. Rivest, Ronald Rivest, Ronald- Massachusetts Institute of Technology. IEEE Conference on Computational Complexity IEEE Conference on Computational Complexity- Permanent web site for the series (started as "Structure in Complexity Theory" in 1986) with charter, committee membership, current an… The Alan Turing Internet Scrapbook The Alan Turing Internet Scrapbook- On-line extract from the book "Alan Turing: the enigma" by Andrew Hodges. Turing Machine Simulator Turing Machine Simulator- A simulator which runs included programs such as a palindrome detector and also allows writing of programs. Turing Machines Turing Machines- Article in Stanford Encyclopedia of Philosophy. Turing machine Turing machine- Wikipedia Article on Turing machines, containing examples, history and further references. Push-Down Automata Push-Down Automata- Notes for a linguistics course defining PDA and showing their relation to context free languages. Pushdown Automata Pushdown Automata- A site with a formal definition of PDA, some examples and a proof that PDA accept context free languages. Non-determinsitic Pushdown Automata Non-determinsitic Pushdown Automata- A definition of NPDA with examples and a proof that NPDA accept context free languages. Pushdown automaton Pushdown automaton- A Wikipedia article with a definition and simple example. Sequential Log Implementation Sequential Log Implementation- A set of slides comparing Moore and Mealy machines and showing how they are used in designing the logic for vending machines and traffic light contr… Moore Machine Moore Machine- Wikipedia article on Moore machines which are FSA with output determined by current state alone. Mealy Machine Mealy Machine- Wikipedia article on Mealy machines, which are simple transducers. Specification of Sequential Systems Specification of Sequential Systems- The application of Moore and Mealy machines in the design of synchronous sequential systems. Finite State Machines with Output (Mealy and Moore Machines) Finite State Machines with Output (Mealy and Moore Machines)- Articles which converts an FSA to equivalent Moore and Mealy machines and discusses their equivalence. Implementing Mealy and Moore Machines Implementing Mealy and Moore Machines- This site has an example of conversion of a FSA to equivalent Moore and Mealy machines. Linear-bounded Automaton Linear-bounded Automaton- Example of construction of an LBA to accept a particular context free language. Linear Bounded Automata Linear Bounded Automata- Set of slides for lectures on LBA. Linear Bounded Automaton Linear Bounded Automaton- Wikipedia article defines LBA and shows their place in the Chomsky hierarchy.