Entry Gramond:1999:UJI from sigcse1990.bib

Last update: Wed Sep 26 02:07:32 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Gramond:1999:UJI,
  author =       "Eric Gramond and Susan H. Rodger",
  title =        "Using {JFLAP} to Interact with Theorems in Automata
                 Theory",
  journal =      j-SIGCSE,
  volume =       "31",
  number =       "1",
  pages =        "336--340",
  month =        mar,
  year =         "1999",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/299649.299800;
                 https://doi.org/10.1145/384266.299800",
  ISBN =         "1-58113-085-6",
  ISBN-13 =      "978-1-58113-085-0",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 16:56:36 MST 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/conf/sigcse/sigcse1999.html#GramondR99;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  URL =          "ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/1999.bib;
                 ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/Pape.bib",
  abstract =     "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
                 running nondeterministic versions of finite automata,
                 pushdown automata, and Turing machines. Recently, we
                 have enhanced JFLAP to allow one to study the proofs of
                 several theorems that focus on conversions of
                 languages, from one form to another, such as converting
                 an NFA to a DFA and then to a minimum state DFA. In
                 addition, our enhancements combined with other tools
                 allow one to interactively study LL and LR parsing
                 methods.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIGCSE Bulletin (ACM Special Interest Group on
                 Computer Science Education)",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J688",
}

Related entries