SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
Introduction to the Theory of Computation
Introduction to the Theory of Computation
automata theory: its relevance to computer science students and course contents
Proceedings of the 37th SIGCSE technical symposium on Computer science education
Turning automata theory into a hands-on course
Proceedings of the 37th SIGCSE technical symposium on Computer science education
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
A computing perspective on the Bologna process
ITiCSE-WGR '06 Working group reports on ITiCSE on Innovation and technology in computer science education
JFLAP: An Interactive Formal Languages and Automata Package
JFLAP: An Interactive Formal Languages and Automata Package
An Introduction to Formal Language and Automata
An Introduction to Formal Language and Automata
RegeXeX: an interactive system providing regular expression exercises
Proceedings of the 38th SIGCSE technical symposium on Computer science education
Hi-index | 0.00 |
We present a practical and up-to-date proposal to teach formal languages. It takes advantage of frequent use of regular-expressions to specify entry data forms in different contexts and, particularly, in three-layer web applications. Compared to more classical approaches our method improves significantly the acquainting of students with the immediate practical utility of the concepts involved in formal language definition. Students must develop code fragments based on JavaScript notation of regular-expressions. Accordingly, any web browser can be a suitable platform for the execution of solutions. The experience has proved to be effective and well-accepted by students and teachers.