article

Free Access

JFLAP (poster): an aid to studying theorems in automata theory

Authors:
Susan H. Rodger

Duke University, Computer Science Department, Box 90129, Durham, NC

Duke University, Computer Science Department, Box 90129, Durham, NC
View Profile

,
Eric Gramond

Duke University, Computer Science Department, Box 90129, Durham, NC

Duke University, Computer Science Department, Box 90129, Durham, NC
View Profile

Authors Info & Claims

ACM SIGCSE Bulletin Volume 30 Issue 3Sept. 1998https://doi.org/10.1145/290320.283635

Published:01 August 1998Publication History

ACM SIGCSE Bulletin

Abstract

No abstract available.

Index Terms

JFLAP (poster): an aid to studying theorems in automata theory
1. Social and professional topics
  1. Professional topics
    1. Computing education
      1. Model curricula
2. Theory of computation
  1. Models of computation
    1. Abstract machines

Recommendations

Using JFLAP to interact with theorems in automata theory
SIGCSE '99: The proceedings of the thirtieth SIGCSE technical symposium on Computer science education

An automata theory course can be taught in an interactive, hands-on manner using a computer. At Duke we have been using the software tool JFLAP to provide interaction and feedback in CPS 140, our automata theory course. JFLAP is a tool for designing and ...
Read More
Using JFLAP to interact with theorems in automata theory

An automata theory course can be taught in an interactive, hands-on manner using a computer. At Duke we have been using the software tool JFLAP to provide interaction and feedback in CPS 140, our automata theory course. JFLAP is a tool for designing and ...
Read More
A Learning Algorithm for Deterministic Finite Automata using JFLAP

The JFLAP package is a free, interactive visualization, and teaching tool for formal languages. JFLAP is based on the principle that a picture of a concept can be easier to understand than a textual representation. With the help of this package, we ...
Read More

Comments

Login options

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

Full Access

Get this Article

Published in
ACM SIGCSE Bulletin Volume 30, Issue 3
Sept. 1998
313 pages
ISSN:0097-8418
DOI:10.1145/290320
Chairmen:
Bruce J. Klein
Grand Valley State Univ., Allendale, MI
,
Gordon Davies
Open Univ., UK
,
Mícheál Ó. Ó'hÉigeartaign
Open Univ., UK
,
Editor:
John Impagliazzo
Hofstra Univ., Hempstead, NY
Issue’s Table of Contents
ITiCSE '98: Proceedings of the 6th annual conference on the teaching of computing and the 3rd annual conference on Integrating technology into computer science education: Changing the delivery of computer science education
August 1998
315 pages
ISBN:1581130007
DOI:10.1145/282991
Chairmen:
Gordon Davies
Open Univ., UK
,
Mícheál ÓΉigeartaigh
Dublin City Univ., Ireland
Copyright © 1998 ACM
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]
Sponsors
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
- Published: 1 August 1998
Check for updates
Qualifiers
- article
Conference
Funding Sources
Other Metrics
View Article Metrics

Article Metrics
- 7
  Total Citations
  View Citations
- 334
  Total Downloads
- Downloads (Last 12 months)69
- Downloads (Last 6 weeks)18
Other Metrics
View Author Metrics
Cited By
View all

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

JFLAP (poster): an aid to studying theorems in automata theory

ACM SIGCSE Bulletin

Abstract

Cited By

Index Terms

Recommendations

Using JFLAP to interact with theorems in automata theory

Using JFLAP to interact with theorems in automata theory

A Learning Algorithm for Deterministic Finite Automata using JFLAP

Comments

Login options

Full Access

Published in

Sponsors

In-Cooperation

Publisher

Publication History

Check for updates

Qualifiers

Conference

Funding Sources

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF Format

eReader

Digital Edition

Caption

JFLAP (poster): an aid to studying theorems in automata theory

ACM SIGCSE Bulletin

Abstract

Cited By

Index Terms

Recommendations

Using JFLAP to interact with theorems in automata theory

Using JFLAP to interact with theorems in automata theory

A Learning Algorithm for Deterministic Finite Automata using JFLAP

Comments

Login options

Full Access

Published in

Sponsors

In-Cooperation

Publisher

Publication History

Check for updates

Qualifiers

Conference

Funding Sources

Article Metrics

Other Metrics

PDF Format

eReader

Digital Edition

Share this Publication link

Share on Social Media