Reykjavik University

Courses/ E-402-STFO/ STFO24/ Module 2/ Assignment
Log in

Module 2

Welcome to Module 2

13
Problems
26
Students
46
Languages
406
Submissions

Start & End Times

Start Time 2024-11-27 16:00 CET
End time 2024-12-03 01:00 CET

Problems

Label Problem
A Deterministic Finite Automata - Read
B Deterministic Finite Automata - Complement
C Deterministic Finite Automata - Union
D Deterministic Finite Automata - Intersection
E Deterministic Finite Automata - Difference
F Deterministic Finite Automata - Symmetric Difference
G Deterministic Finite Automata - Concatenation
H Deterministic Finite Automata - Kleene Star
I Deterministic Finite Automata - Is the Empty Language?
J Deterministic Finite Automata - Is a Finite Language?
K Deterministic Finite Automata - Minimum Word Length
L Deterministic Finite Automata - Maximum Word Length
M Deterministic Finite Automata - Enumeration

Scoring

Partial Credit — Ranked

Explanation:
Standard scoreboard type for problems with partial credit. Participants are ranked by the sum of the score of each problem. There is no tiebreaker.

Results

  • Results are shown without limitation.

Languages

Ada Algol 68 APL Bash C C# C++ COBOL Common Lisp Crystal D Dart Elixir Erlang F# Forth Fortran Go Haskell Java JavaScript (Node.js) JavaScript (SpiderMonkey) Julia Kotlin Lua Modula-2 Nim Objective-C OCaml Octave Odin Pascal Perl PHP Prolog Python 3 Racket Ruby Rust Simula 67 Smalltalk SNOBOL Swift TypeScript Visual Basic Zig