Končni avtomati : diplomsko delo

Rogač, Luka Viktor (author), Malnič, Aleksander (mentor), Zapušek, Matej (co-mentor)

V diplomskem delu je predstavljen formalni koncept jezika, kjer se seznanimo s pojmi, povezanimi s formalnim konceptom jezika in operacije nad jeziki. Neformalno in formalno spoznamo pojem končni avtomat ter si ogledamo podobnosti in razlike med determinističnim in nedeterminističnim končnim avtomatom. Opisan je koncept regularnega izraza in regularnega jezika, s katerim jezike, ki jih končni avtomati sprejmajo, zapišemo v pregledni in krajši obliki. V okviru diplomskega del je bila izdelana didaktična aplikacija, ki animirano ponazarja procesiranje končnega avtomata glede na vneseno vhodno besedo. Podrobno je opisano programsko okolje aplikacije z razlago programske kode in navodili za uporabo. Naveden je tudi primer uporabe didaktične aplikacije v praksi, na primer pri računalniškem krožku.

• Language: Slovenian
• Keywords: končni avtomat, regularni izraz, regularni jezik, animiran prikaz procesiranja končnega avtomata
• Work type: Bachelor thesis/paper
• Typology: 2.11 - Undergraduate Thesis
• Organization: PEF - Faculty of Education
• Publisher: [L.V. Rogač]
• Year: 2015
• Number of pages: 26 str.
• PID: 20.500.12556/RUL-72707
• UDC: 004.4(043.2)
• COBISS.SI-ID: 10719305
• Publication date in RUL: 29.09.2015

Secondary language

• Language: English
• Title: Finite automata

Abstract

In this diploma work the concept of formal language is presented, introducing the ideas related to the concept of formal language and operations over languages. Informal and formal recognition of the concept of the finite state automata is given together with the similarities and differences between deterministic and nondeterministic finite state automata. The concept of regular expression and regular language is described, enabling a transparent and shorter form at writing of the language acceptable by the finite state automata. As a part of the diploma work the didactic application illustrating the processing of the finite state automata according to the entered input word was developed. The programming environment of the application and the interpretation of the source code with instructions for its using are described in detail. An example for the usage of the application at teaching, for example in a computer club, is presented.

• Keywords: finite state automata