J. EDUCATIONAL COMPUTING RESEARCH, Vol, 2005 SOLVING PROBLEMS REDUCTIVELY MICHAL ARMONI The Open University of Israel and School of Education, Tel-Aviv University

First Page		Document Content
Date: 2007-10-29 03:55:14 Finite automata Computability Deterministic automaton Computational complexity theory Deterministic finite automaton Finite-state machine Regular language Reduction Algorithm Theoretical computer science Mathematics Cognitive science		J. EDUCATIONAL COMPUTING RESEARCH, Vol, 2005 SOLVING PROBLEMS REDUCTIVELY MICHAL ARMONI The Open University of Israel and School of Education, Tel-Aviv University Add to Reading List Source URL: www.openu.ac.il Download Document from Source Website File Size: 848,16 KB Share Document on Facebook

	Conflict and Computation on Wikipedia: a Finite-State Machine Analysis of Editor Interactions DocID: 1sfbi - View Document
	cs281: Introduction to Computer Systems Prelab for Lab06 – Introduction to Sequential Circuits Overview In this lab, we will learn about designing circuits that utilize memory (and a clock) in order to achieve some DocID: 1rqsB - View Document
	Performance Enhancement with Speculative Execution Based Parallelism for Processing Large-scale XML-based Application Data Michael R. Head DocID: 1rjTr - View Document
	Back to the Roots: Implementing the RTOS as a Specialized State Machine Christian Dietrich, Martin Hoffmann, Daniel Lohmann Department of Computer Science 4 - Distributed Systems and Operating Systems Friedrich-Alexander DocID: 1riTt - View Document
	Parameterized Dataflow Scenarios Mladen Skelin, Marc Geilen, Francky Catthoor, Sverre Hendseth ES Reports ISSNESR DocID: 1r6CB - View Document