This paper introduces TAGS (Transducer Automata Graphical Simulator), a software tool for teaching different aspects of transducer automata theory, a theoretical topic which underlies many aspects of the design of sequential digital circuits. TAGS allows simulation of both Moore and Mealy transducer automata, integrating different theoretical concepts associated with them. The student can define an arbitrary transducer automaton in an interactive way, being able to simulate and trace its behavior by means of different ‘views’.
AebliH., Denken: Das Ordnen des Tuns — Kognitive Aspekte der Handlungstheorie (Klett-Cota, Stuttgart, 1980).
2.
Ben-AriM., ‘Constructivism in Computer Science Education’, J. Computers in Mathematics and Science Teaching, 20(1) (2001), 45–73.
3.
BilskaA.LeiderK.ProcopiucM.ProcopiucO.RodgerS.SalemmeJ. and TsangE., ‘A collection of tools for making automata theory and formal languages come alive’, in Proc. 28th SIGCSE Technical Symposium on Computer Science Education, 1997, pp. 15–19.
4.
BoothT. L., Sequential Machines and Automata Theory (John Wiley & Sons, New York, 1967).
5.
BrownS. and VranesicZ., Fundamentals of Digital Logic with Verilog Design (McGraw-Hill, New York, 2003).
6.
BrunerJ., Towards a Theory of Instruction (Harvard University Press, Harvard, 1966).
7.
BrunerJ., Actual Minds, Possible Worlds (Harvard University Press, Harvard, 1986).
8.
ChesñevarC.CoboM. and YurcikW., ‘Using theoretical computer simulators for formal languages and automata theory’, ACM SIGCSE Bulletin, 35(2) (2003), 33–37.
9.
ChesñevarC.MaguitmanA.GonzálezM. P. and CoboL., ‘Teaching fundamentals of computing theory: A constructivist approach’, J. Computer Sci. Technology, special issue on Computer Science Education, 4(2) (2005), 91–97.
10.
CohenD., Introduction to Computer Theory (John Wiley & Sons, New York, 1997).
11.
EsmorisA. and ChesñevarC., ‘Una Herramienta para la Simulación de Autómatas Traductores en la Enseñanza de Teoría de la Computación’, in Proc. IX Argentinean Conference in Computer Science, (2003), 287–295.
12.
FinkL. D., Creating Significant Learning Experiences: An integrated approach to designing college courses (John Wiley & Sons, New York, 2003).
13.
GhezziC.JazayeriM. and MandrioliD., Fundamentals of Software Engineering (Prentice Hall, Englewood Cliffs, 1991).
14.
GoldinD., ‘Persistent Turing machines as a model of interactive computation’, in Proc. 1st Intl. Symp. on Foundations of Information and Knowledge Systems (Springer, Berlin, 2000), pp. 116–135.
15.
HartmanisJ., ‘Observations about the development of theoretical computer science’, Ann. Hist. Computing, 3(1) (1981), 42–51.
16.
HopcroftJ. and UllmanJ., Introduction to Automata Theory, Languages and Computation (Addison-Wesley, New York, 1979).
17.
HossainA., Computer Aided Electronic Circuit Board Design and Fabrication: Using OrCAD/SDT and OrCAD/PCB Software Tools (Prentice Hall, Englewood Cliffs, 1995).
MealyG. H., ‘A method for synthesizing sequential circuits’, Bell Systems Journal, 34(5) (1955), 1045–1079.
20.
MooreE. F., ‘Gedanken experiments on sequential machines’, in ShannonC. E. and McCarthyJ., eds, Automata Studies (Princeton University Press, Princeton, 1956), pp. 129–153.
21.
RasalaR., ‘Toolkits in first year computer science: A pedagogical imperative’, ACM SIGCSE Bulletin32(1), (2000), pp. 185–191.
22.
WatsonB. W., ‘Taxonomy of finite automata minimization algorithms’, Computing Science Note 93/44, Eindhoven University of Technology, The Netherlands, 1993.
23.
YehezkelC.YurcikW. and PearsonM., ‘Teaching computer architecture with a computer-aided learning environment: State-of-the-art simulators’, in Proc. Intl. Conf. on Simulation in Engineering Education, Phoenix, Arizona, 2001.
24.
WakerlyJ. F., Digital Design. Principles and Practices, 2nd edn (Prentice Hall, Englewood Cliffs, 1995).
