demonstration

Teaching push-down automata and turing machines

Authors:

César García-Osorio,

Iñigo Mediavilla-Sáiz,

Javier Jimeno-Visitación,

Nicolás García-PedrajasAuthors Info & Claims

ACM SIGCSE Bulletin, Volume 40, Issue 3

Page 316

https://doi.org/10.1145/1597849.1384359

Published: 30 June 2008 Publication History

Get Access

Abstract

In this paper we present the new version of a tool to assist in teaching formal languages and automata theory. In the previous version the tool provided algorithms for regular expressions, finite automata and context free grammars. The new version can simulate as well push-down automata and Turing machines.

References

[1]

J. Bovet. Visual Automata Simulator. (http://www.cs.usfca.edu/~jbovet/vas.html, last visited 19-Feb-2007).

Google Scholar

[2]

C. Burch. Automaton Simulator. (http://ozark.hendrix.edu/~burch/proj/autosim/, last visited 19-Feb-2007).

Google Scholar

[3]

S. H. Rodger. Java Interactive Formal Languages and Automata Package. (http://www.jflap.org/, last visited 19-Feb-2007).

Google Scholar

Cited By

View all

Frede CKnobelsdorf MMalmi LKorhonen AMcCartney RPetersen AMalmi LMcCartney R(2018)Exploring how Students Perform in a Theory of Computation Course using Final Exam and Homework Assignments DataProceedings of the 2018 ACM Conference on International Computing Education Research10.1145/3230977.3230996(241-249)Online publication date: 8-Aug-2018
https://dl.acm.org/doi/10.1145/3230977.3230996
Tecson CRodrigo M(2018)Tutoring Environment for Automata and the Users' Achievement Goal Orientations2018 IEEE International Conference on Teaching, Assessment, and Learning for Engineering (TALE)10.1109/TALE.2018.8615234(526-533)Online publication date: Dec-2018
https://doi.org/10.1109/TALE.2018.8615234
Knobelsdorf MFrede CBöhne SKreitz CTenenberg JChinn DSheard JMalmi LTenenberg JMalmi L(2017)Theorem Provers as a Learning Tool in Theory of ComputationProceedings of the 2017 ACM Conference on International Computing Education Research10.1145/3105726.3106184(83-92)Online publication date: 14-Aug-2017
https://dl.acm.org/doi/10.1145/3105726.3106184
Show More Cited By

Index Terms

Teaching push-down automata and turing machines
1. Theory of computation
  1. Formal languages and automata theory
    1. Grammars and context-free languages
  2. Semantics and reasoning
    1. Program reasoning
      1. Parsing

Recommendations

Teaching push-down automata and turing machines
ITiCSE '08: Proceedings of the 13th annual conference on Innovation and technology in computer science education

In this paper we present the new version of a tool to assist in teaching formal languages and automata theory. In the previous version the tool provided algorithms for regular expressions, finite automata and context free grammars. The new version can ...
Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata

We investigate the conversion of one-way nondeterministic finite automata and context-free grammars into Parikh equivalent one-way and two-way deterministic finite automata, from a descriptional complexity point of view. We prove that for each one-way ...
Turning automata theory into a hands-on course

We present a hands-on approach to problem solving in the formal languages and automata theory course. Using the tool JFLAP, students can solve a wide range of problems that are tedious to solve using pencil and paper. In combination with the more ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGCSE Bulletin Volume 40, Issue 3

ITiCSE '08

September 2008

362 pages

ISSN:0097-8418

DOI:10.1145/1597849

Issue’s Table of Contents

ITiCSE '08: Proceedings of the 13th annual conference on Innovation and technology in computer science education
June 2008
394 pages
ISBN:9781605580784
DOI:10.1145/1384271
Conference Chairs:
June Amillo
Universidad Politécnica de Madrid, Spain
,
Cary Laxer
Rose-Hulman Institute of Technology, USA
,
Program Chairs:
Ernestina Menasalvas
Universidad Politécnica de Madrid, Spain
,
Alison Young
Unitec, New Zealand

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 June 2008

Published in SIGCSE Volume 40, Issue 3

Check for updates

Author Tags

Qualifiers

Demonstration

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
356
Total Downloads

Downloads (Last 12 months)9
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Frede CKnobelsdorf MMalmi LKorhonen AMcCartney RPetersen AMalmi LMcCartney R(2018)Exploring how Students Perform in a Theory of Computation Course using Final Exam and Homework Assignments DataProceedings of the 2018 ACM Conference on International Computing Education Research10.1145/3230977.3230996(241-249)Online publication date: 8-Aug-2018
https://dl.acm.org/doi/10.1145/3230977.3230996
Tecson CRodrigo M(2018)Tutoring Environment for Automata and the Users' Achievement Goal Orientations2018 IEEE International Conference on Teaching, Assessment, and Learning for Engineering (TALE)10.1109/TALE.2018.8615234(526-533)Online publication date: Dec-2018
https://doi.org/10.1109/TALE.2018.8615234
Knobelsdorf MFrede CBöhne SKreitz CTenenberg JChinn DSheard JMalmi LTenenberg JMalmi L(2017)Theorem Provers as a Learning Tool in Theory of ComputationProceedings of the 2017 ACM Conference on International Computing Education Research10.1145/3105726.3106184(83-92)Online publication date: 14-Aug-2017
https://dl.acm.org/doi/10.1145/3105726.3106184
Knobelsdorf MFrede CSheard JTenenberg JChinn DDorn B(2016)Analyzing Student Practices in Theory of Computation in Light of Distributed Cognition TheoryProceedings of the 2016 ACM Conference on International Computing Education Research10.1145/2960310.2960331(73-81)Online publication date: 25-Aug-2016
https://dl.acm.org/doi/10.1145/2960310.2960331
Chakraborty PSaxena PKatti C(2011)Fifty years of automata simulationACM Inroads10.1145/2038876.20388932:4(59-70)Online publication date: 1-Dec-2011
https://dl.acm.org/doi/10.1145/2038876.2038893
Pillay N(2010)Learning difficulties experienced by students in a course on formal languages and automata theoryACM SIGCSE Bulletin10.1145/1709424.170944441:4(48-52)Online publication date: 18-Jan-2010
https://dl.acm.org/doi/10.1145/1709424.1709444
Ali LSahawneh NAgha YKanwal SImran Elmitwally N(2022)Activity Based Easy Learning Of PushDown Automata2022 International Conference on Cyber Resilience (ICCR)10.1109/ICCR56254.2022.9996012(1-8)Online publication date: 6-Oct-2022
https://doi.org/10.1109/ICCR56254.2022.9996012
Wilhelm-Weidner ABergner NJoy MIhantola P(2018)On Supplementing Theoretical Computer Science Courses using E-LearningProceedings of the 18th Koli Calling International Conference on Computing Education Research10.1145/3279720.3279734(1-10)Online publication date: 22-Nov-2018
https://dl.acm.org/doi/10.1145/3279720.3279734

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Teaching push-down automata and turing machines

Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata

Turning automata theory into a hands-on course