Menu
Submit Site
Home
Computer
Computer Science
All sites of Computer Science
SIGCOMM: Data Communication
SIGCOMM: Data Communication- Forum for the discussion of communications and networking, including their technical and social implications, with a special focus on architecture. ...
SIGDOC: Documentation
SIGDOC: Documentation- Provides a conference and journal for those involved in the creation of computer documentation. ...
SIGMIS: Management Information Systems
SIGMIS: Management Information Systems- Fosters communication on the management of information systems and computing personnel. ...
SIGMM: Multimedia
SIGMM: Multimedia- Provides a forum for researchers and practitioners of multimedia computing. ...
SIGMOBILE: Mobility of Systems, Users, Data and Computing
SIGMOBILE: Mobility of Systems, Users, Data and Computing- Publishes journals and supports conferences dealing with portable computers and wireless networking. ...
SIGOPS: Operating Systems
SIGOPS: Operating Systems- Addresses issues dealing with operating systems research and development. ...
SIGSOFT: Software Engineering
SIGSOFT: Software Engineering- Provides a forum for discussion of principles, practices and research of software engineering. ...
SIGUCCS: University and College Computing Services
SIGUCCS: University and College Computing Services- Seeks professional development of those delivering the support and management of information technology to higher education. ...
SIGWEB: Hypertext, Hypermedia and the Web
SIGWEB: Hypertext, Hypermedia and the Web- Provides a forum for the exchange of ideas regarding the research and application of hypermedia on the web and elsewhere. ...
SIGARCH: Computer Architecture
SIGARCH: Computer Architecture- Serves those working in computer design in the academy or industry. ...
SIGAPP: Applied Computing
SIGAPP: Applied Computing- Furthers the interests of those creating new computing applications or applying old solutions to new situations. ...
SIGKDD: Knowledge Discovery in Data and Data Mining
SIGKDD: Knowledge Discovery in Data and Data Mining- Encourages data-mining research, market standards and education. ...
SIGCAPH: Computers and the Physically Handicapped
SIGCAPH: Computers and the Physically Handicapped- Promotes the interests of those, both in the academy and industry, who do research and development in the application of technology to disabilities. ...
SIGPLAN: Programming Languages
SIGPLAN: Programming Languages- Explores the implementation and efficient use of programming languages. ...
SIGSAM: Symbolic and Algebraic Manipulation
SIGSAM: Symbolic and Algebraic Manipulation- Provides a forum to exchange ideas about the theoretical and practical aspects. ...
SIGSAC: Security, Audit and Control
SIGSAC: Security, Audit and Control- Sponsors conferences and workshops on information security. ...
SIGSIM: Simulation and Modeling
SIGSIM: Simulation and Modeling- Promotes the advancement of simulation and modeling. ...
SIGIR: Information Retrieval
SIGIR: Information Retrieval- "Addresses issues ranging from theory to user demands in the application of computers to the acquisition, organization, storage, retrieval, and distribution of information." ...
SIGAda: Ada Programming Language
SIGAda: Ada Programming Language- Focuses on the scientific, technical and organizational aspects of Ada's use and standardization. ...
ACM: Special Interest Groups Guide
ACM: Special Interest Groups Guide- Lists the SIGs and their purposes, linking to each of them. ...
Finite State Automata
Finite State Automata- An introduction to deterministic and nondeterministic FSA, with simple examples. ...
Nondeterministic Finite State Machines
Nondeterministic Finite State Machines- A Wikipedia article on nondeterministic FSA. ...
Finite State Transducers
Finite State Transducers- Definition of FST with examples of simple transducers. ...
Finite State Transducers
Finite State Transducers- Wikipedia article with a formal definition and discussion of operators on FST. ...
Applications of Finite-State Transducers in Natural-Language Processing
Applications of Finite-State Transducers in Natural-Language Processing- A paper reviewing some of the major applications of FST in natural-language processing ranging from morphological analysis to finite-state parsing. ...
Parsing With Finite State Transducers
Parsing With Finite State Transducers- A paper that shows how FST can be used to describe complex sytactic structures and provide tools to increase parsing efficiency. ...
Finite-state Transducers
Finite-state Transducers- A set of slides on finite state transducers, their connection to regular relations and examples of their closure properties. ...
Finite State Parsers and Transducers
Finite State Parsers and Transducers- Lecture notes on FST and their use in building parsers with examples implemented in Prolog. ...
Linear Bounded Automata
Linear Bounded Automata- A course note chapter with a definition of LBA and examples. ...
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. ...
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. ...
Specification of Sequential Systems
Specification of Sequential Systems- The application of Moore and Mealy machines in the design of synchronous sequential systems. ...
Mealy Machine
Mealy Machine- Wikipedia article on Mealy machines, which are simple transducers. ...
Moore Machine
Moore Machine- Wikipedia article on Moore machines which are FSA with output determined by current state alone. ...
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 controllers. ...
Pushdown automaton
Pushdown automaton- A Wikipedia article with a definition and simple example. ...
Non-determinsitic Pushdown Automata
Non-determinsitic Pushdown Automata- A definition of NPDA with examples and a proof that NPDA accept 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. ...
Push-Down Automata
Push-Down Automata- Notes for a linguistics course defining PDA and showing their relation to context free languages. ...
Turing machine
Turing machine- Wikipedia Article on Turing machines, containing examples, history and further references. ...
Turing Machines
Turing Machines- Article in Stanford Encyclopedia of Philosophy. ...
Turing Machine Simulator
Turing Machine Simulator- A simulator which runs included programs such as a palindrome detector and also allows writing of programs. ...
The Alan Turing Internet Scrapbook
The Alan Turing Internet Scrapbook- On-line extract from the book "Alan Turing: the enigma" by Andrew Hodges. ...
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 announcements and archives. ...
Rivest, Ronald
Rivest, Ronald- Massachusetts Institute of Technology. ...
Papadimitriou, Christos H.
Papadimitriou, Christos H.- Author of the very popular book on complexity theory. Home page with recent publications and links to courses. ...
Hajiaghayi, Mohammad Taghi
Hajiaghayi, Mohammad Taghi- Massachusetts Institute of Technology. ...
Håstad, Johan
Håstad, Johan- Kungliga Tekniska högskolan. ...
Hemaspaandra, Lane
Hemaspaandra, Lane- University of Rochester. ...
Hermann, Miki
Hermann, Miki- National Center for Scientific Research (France). ...
« First
Previous
Page 27 of 33.
Next
Last »
Latest sites from Computer Science
ACM Events and Conferences
MFCS 2007
ICITA 2008
DBFUSION 2001
ICDT 2005
VLDB 2008
VLDB 2002
Boitho
Gómez PEER Community
Ball, Thomas
Banerjee, Subhashis
Balakrishnan, M.
University of Jaffna
Linear Bounded Automaton
Linear Bounded Automata
Linear-bounded Automaton
Complexity People
Frisch, Alan
Levesque, Hector
Franco, John
Vardi, Moshe Y.
Parberry, Ian
Van Melkebeek, Dieter
Kosub, Sven
Goldwasser, Shafi
Send feedback
submit