![Finite automata / Computability / Deterministic automaton / Computational complexity theory / Deterministic finite automaton / Finite-state machine / Regular language / Reduction / Algorithm / Theoretical computer science / Mathematics / Cognitive science Finite automata / Computability / Deterministic automaton / Computational complexity theory / Deterministic finite automaton / Finite-state machine / Regular language / Reduction / Algorithm / Theoretical computer science / Mathematics / Cognitive science](https://www.pdfsearch.io/img/6ed020423ed6b8583b625a5b9f2edaa3.jpg) Date: 2007-10-29 03:55:14Finite 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 UniversityAdd to Reading ListSource URL: www.openu.ac.ilDownload Document from Source Website File Size: 848,16 KBShare Document on Facebook
|