Κεφάλαιο 7Adobe PDF
(326.62 kB)
| Title Details: | |
|
Finite Automata and Regular Representations |
|
| Authors: |
Zachos, Efstathios Pagourtzis, Aristeidis Souliou, Theodora |
| Reviewer: |
Zissimopoulos, Vassilis |
| Description: | |
| Abstract: |
Machines with a finite number of states, transition function. Deterministic and non-deterministic finite automata (DFA, NFA). Rabin-Scott theorem: equivalence of NFA and DFA. Minimization of automata. Product of automata. Regular representations and equivalence with finite automata (Pumping Lemma).
|
| Type: |
Chapter |
| Creation Date: | 2015 |
| Item Details: | |
| License: |
http://creativecommons.org/licenses/by-nc-sa/3.0/gr |
| Handle | http://hdl.handle.net/11419/5458 |
| Bibliographic Reference: | Zachos, E., Pagourtzis, A., & Souliou, T. (2015). Finite Automata and Regular Representations [Chapter]. In Zachos, E., Pagourtzis, A., & Souliou, T. 2015. Computer Science Foundation [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/5458 |
| Language: |
Greek |
| Is Part of: |
Computer Science Foundation |
| Publication Origin: |
Kallipos, Open Academic Editions |