Course syllabus
Course-PM
TMV027 / DIT321 Finite automata theory and formal languages lp3 vt19 (7.5 hp)
Course is offered by the department of Computer Science and Engineering
Contact details
List of...
- examiner
- lecturer
- teachers
- supervisors
...along with their contact details. If the course have external guest lecturers or such, give a brief description of their role and the company or similar they represent.
If needed, list administrative staff, along with their contact details.
Course purpose
Short description of the course purpose and content: can be copied from syllabus in Studieportalen. Additional information can be added.
Schedule
Course literature
List all mandatory literature, including descriptions of how to access the texts (e.g. Cremona, Chalmers Library, links).
Also list reference literature, further reading, and other non-mandatory texts.
Course design
Description of the course's learning activities; how they are implemented and how they are connected. This is the student's guide to navigating the course. Do not forget to give the student advice on how to learn as much as possible based on the pedagogy you have chosen. Often, you may need to emphasize concrete things like how often they should enter the learning space on the learning platform, how different issues are shared between supervisors, etc.
Provide a plan for
- lectures
- exervises
- laboratory work
- projects
- supervision
- feedback
- seminars
Should contain a description of how the digital tools (Canvas and others) should be used and how they are organized, as well as how communication between teachers and students takes place (Canvas, e-mail, other).
Do not forget to describe any resources that students need to use, such as lab equipment, studios, workshops, physical or digital materials.
You should be clear how missed deadlines and revisions are handled.
Changes made since the last occasion
A summary of changes made since the last occasion.
Learning objectives and syllabus
Learning objectives:
Knowledge and understanding
- Explain and manipulate the different concepts in automata theory and formal languages such as formal proofs, (non-)deterministic automata, regular expressions, regular languages, context-free grammars, context-free languages, Turing machines;
- Explain the power and the limitations of regular languages and context-free languages.
- Prove properties of languages, grammars and automata with rigorously formal mathematical methods;
- Design automata, regular expressions and context-free grammars accepting or generating a certain language;
- Describe the language accepted by an automaton or generated by a regular expression or a context-free grammar;
- Transform between equivalent deterministic and non-deterministic finite automata, and regular expressions;
- Simplify automata and context-free grammars;
- Determine if a certain word belongs to a regular or context-free language;
- Define Turing machines performing simple tasks.
- Differentiate and manipulate formal descriptions of languages, automata and grammars with focus on regular and context-free languages, finite automata and regular expressions.
Link to the syllabus on Studieportalen.
If the course is a joint course (Chalmers and Göteborgs Universitet) you should link to both syllabus (Chalmers and Göteborgs Universitet).
Examination form
Description of how the examination – written examinations and other – is executed and assessed.
Include:
- what components are included, the purpose of these, and how they contribute to the learning objectives
- how compulsory and/or voluntary components contribute to the final grade
- grading limits and any other requirements for all forms of examination in order to pass the course (compulsory components)
- examination form, e.g. if the examination is conducted as a digital examination
- time and place of examination, both written exams and other exams such as project presentations
- aids permitted during examinations, as well as which markings, indexes and notes in aids are permitted
Do not forget to be extra clear with project assignments; what is the problem, what should be done, what is the expected result, and how should this result be reported. Details such as templates for project reports, what happens at missed deadlines etc. are extra important to include.
Course summary:
Date | Details | Due |
---|---|---|