Abstract (EN)
Finite state automata have many applications in mathematics, logic, compilers, biology and statistics. In this thesis we expose this subject with an enormous variety of applications with special emphasis on the fundamental concepts such as automata, language recognized by an automata, rational sets and Kleene's Theorem, syntactic kongruans, minimal and reduced automata. Key words and Phrases : Free semigroups, monoids, finite state automata, language, syntactic kongruans. ^gs^ssr-2»
Author
Ömür Soytürk
How to Cite
Ömür Soytürk (Master Thesis). Automata and languages, 2001, Çukurova University.
Keywords
License
Tüm Hakları Saklıdır
This work is shared under the specified license terms.
More theses from Çukurova University
- The effects of collaborative video-blog projects on Turkish EFL students' linguistic and digital literacy skills(2025)
- Credit risk management in banking sector: An application of variables determining credit risk in Turkish banking sector(2011)
- A comprehensive study on indirect evaporative coolers: CFD-based performance analysis, geometric optimization and machine learning models(2025)
- Kazal's of Moldo Kılıç (Phonetical, morphological studies - text-translation)(1998)
- Toplam kalite yönetimi ve Çukurova bölgesindeki tekstil işletmelerindeki uygulamaları(1998)
- A Model for effective supervision from the supervisor and the student-teacher`s perspective: A social constructivist approach(2003)
