In: Proceedings of the 13th annual conference on Innovation and technology in computer science education (ITiCSE 2008), pp. 316–316, ACM, Madrid, Spain, 2008, ISBN: 978-1-60558-115-6.

@inproceedings{SINTICE2007,
title = {Página web dinámica para el aprendizaje de la teoría de autómatas y lenguajes formales},
author = {César García-Osorio and Álvar Arnáiz-González and Andrés Arnáiz-Moreno},
isbn = {978--84--9732--597--4},
year = {2007},
date = {2007-09-01},
booktitle = {Simposio nacional de tecnologías de la información y las comunicaciones en la educación},
pages = {323--326},
address = {Zaragoza},
keywords = {Chomsky normal form, Cocke-Younger-Kasami algorithm, Computer Science teaching, Finite automata, Grammars, LL parsing, Regular expressions},
pubstate = {published},
tppubtype = {inproceedings}
}

THOTH: A new tool for automata theory learning Inproceedings

In: International Technology, Education and Development Conference (INTED2007), International Association of Technology, Education and Development, Valencia, 2007, ISBN: 978-84-611-4517-1.

@inproceedings{cgosorio07THOTH1,
title = {THOTH: A new tool for automata theory learning},
author = {César García-Osorio and Álvar Arnaiz-González and Andrés Arnaiz-Moreno},
isbn = {978-84-611-4517-1},
year = {2007},
date = {2007-03-01},
booktitle = {International Technology, Education and Development Conference (INTED2007)},
publisher = {International Association of Technology, Education and Development},
address = {Valencia},
abstract = {One of the major problems of teaching a course on formal languages and automata theory is that the
students perceive it as too theoretical, dry and difficult. Although it is possible to give a more practical
approach by using examples and solving exercises, these tend to be long and tedious. In this paper
we present ``Thoth'' - a new tool for learning formal languages and automata (downloadable at
urlhttp://pisuerga.inf.ubu.es/cgosorio/THOTH/). This first version is mainly limited to finite automata and
regular languages and grammars, but some functionality of generating LL(1) tables for context free
grammars has been included as well. Although there are other tools that cover a broader range of
subjects of the formal languages and automata field, the advantage of Thoth over them is the user
interface. In Thoth is possible to design an automaton using simple mouse operations. All the
elements can be moved around to make the design more clear and it is possible as well to
automatically distribute them. Besides, Thoth has born with the ambition of being international, the
interface is prepared for four languages: Spanish, English, French and German, and the aspiration of
growing up and include other kinds of devices as ``push down automata'' and ``Turing machines''.},
keywords = {Chomsky normal form, Cocke-Younger-Kasami algorithm, Computer Science teaching, Finite automata, Grammars, LL parsing, Regular expressions},
pubstate = {published},
tppubtype = {inproceedings}
}

One of the major problems of teaching a course on formal languages and automata theory is that the
students perceive it as too theoretical, dry and difficult. Although it is possible to give a more practical
approach by using examples and solving exercises, these tend to be long and tedious. In this paper
we present ``Thoth'' - a new tool for learning formal languages and automata (downloadable at
urlhttp://pisuerga.inf.ubu.es/cgosorio/THOTH/). This first version is mainly limited to finite automata and
regular languages and grammars, but some functionality of generating LL(1) tables for context free
grammars has been included as well. Although there are other tools that cover a broader range of
subjects of the formal languages and automata field, the advantage of Thoth over them is the user
interface. In Thoth is possible to design an automaton using simple mouse operations. All the
elements can be moved around to make the design more clear and it is possible as well to
automatically distribute them. Besides, Thoth has born with the ambition of being international, the
interface is prepared for four languages: Spanish, English, French and German, and the aspiration of
growing up and include other kinds of devices as ``push down automata'' and ``Turing machines''.

@inproceedings{JENUI2007,
title = {Enseñanza asistida de teoría de autómatas y lenguajes formales mediante el uso de THOTH},
author = {César García-Osorio and Andrés Arnáiz-Moreno and Álvar Arnáiz-González},
isbn = {978--84--9732--421--2},
year = {2007},
date = {2007-00-01},
booktitle = {Actas de las XIII Jornadas de Enseñanza Universitaria de Informática (JENUI 2007)},
pages = {425--432},
address = {Teruel},
keywords = {Chomsky normal form, Cocke-Younger-Kasami algorithm, Computer Science teaching, Finite automata, Grammars, LL parsing, Regular expressions},
pubstate = {published},
tppubtype = {inproceedings}
}

We use cookies to ensure that we give you the best experience on our website. If you continue to use this site we will assume that you are happy with it.Ok