Functional Automata - Formal Languages for Computer Science Students

  title={Functional Automata - Formal Languages for Computer Science Students},
  author={M. T. Moraz{\'a}n and Rosario Antunez},
  • M. T. Morazán, Rosario Antunez
  • Published in TFPIE 2014
  • Computer Science
  • An introductory formal languages course exposes advanced undergraduate and early graduate students to automata theory, grammars, constructive proofs, computability, and decidability. Programming students find these topics to be challenging or, in many cases, overwhelming and on the fringe of Computer Science. The existence of this perception is not completely absurd since students are asked to design and prove correct machines and grammars without being able to experiment nor get immediate… CONTINUE READING
    3 Citations
    Didactic Strategy for Learning Theory of Automata & Formal Languages:
    • 1
    • Highly Influenced
    FSM Error Messages
    • 1
    • PDF
    Visual Designing and Debugging of Deterministic Finite-State Machines in FSM
    • PDF


    An introduction to formal languages and automata, 4th Edition
    • 49
    Introduction to the Theory of Computation
    • 2,242
    • PDF
    An Introduction to Formal Languages and Automata
    • 493
    • PDF
    Educational Pearl: Automata via macros
    • 19
    Introduction to Languages and the Theory of Computation" 3rd Ed
    • 265
    • PDF
    jFAST: a java finite automata simulator
    • 34
    • PDF
    Automatic verification for interactive graphical programs
    • 5
    • PDF