Back to Results
First PageMeta Content
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

Document Date: 2007-10-29 03:55:14


Open Document

File Size: 848,16 KB

Share Result on Facebook