| dc.contributor | Fazekas Szilárd | en_EN |
| dc.creator | Horváth Géza | en_EN |
| dc.creator | Nagy Benedek | en_EN |
| dc.date | 2014-04-30 | en_EN |
| dc.date.accessioned | 2019-11-28T19:39:40Z | |
| dc.date.available | 2019-11-28T19:39:40Z | |
| dc.identifier | ISBN 978-963-279-344-3 | en_EN |
| dc.identifier.uri | http://dtk.tankonyvtar.hu/xmlui/handle/123456789/12014 | |
| dc.description | This book discusses the most significant features of formal language theory: the classes
of the Chomsky-hierarchy and the corresponding classes of automata. There are three
descriptions of the regular languages given: regular grammars, regular expressions and
finite automata (both deterministic and nondeterministic versions). The equivalence of
these descriptions are proven. Moreover, finite state transducers, for example, Mealy and
Moore automata are described. Linear languages are presented. The class of context-free
languages are also widely used, Chomsky normal form and Bar-Hillel pumping lemma is
presented. This class are also characterized by push-down automata. The parsing problem
is solved by CYK and Earley algorithms. Context-sensitive languages form a much wider
class. Kuroda normal form is proven for this class. Linear-bounded automata is shown.
Turing machines and the class of recursively enumerable languages, as well as, the class
of recursive languages are presented. Finally, closure properties of the mentioned classes
are also proven. | en_EN |
| dc.format | application/epub+zip | en_EN |
| dc.format | application/pdf | en_EN |
| dc.language | en | en_EN |
| dc.publisher | Typotex Publishing | en_EN |
| dc.rights | Géza Horváth | en_EN |
| dc.rights | Benedek Nagy | en_EN |
| dc.rights | Debreceni Egyetem | en_EN |
| dc.subject | formal languages | en_EN |
| dc.subject | regular languages | en_EN |
| dc.subject | regular expressions | en_EN |
| dc.subject | finite automata | en_EN |
| dc.subject | finite state transducers | en_EN |
| dc.subject | linear languages | en_EN |
| dc.subject | context-free languages | en_EN |
| dc.subject | pushdown automata | en_EN |
| dc.subject | context-sensitive languages | en_EN |
| dc.subject | recursively enumerable languages | en_EN |
| dc.subject | Turing machines | en_EN |
| dc.subject | normal forms | en_EN |
| dc.subject | parsing | en_EN |
| dc.subject | closure properties | en_EN |
| dc.subject | pumping lemma | en_EN |
| dc.title | Formal Languages and Automata Theory | en_EN |
| dc.type | Egyetemi jegyzet | en_EN |
| dtk.fir | Computer Science and Information Technology | en_EN |
| dtk.fir | Arts and Humanities | en_EN |
| dtk.oecd | 06. Humanities::06.02. Languages and Literature::06.02.02. Specific languages | en_EN |
| dtk.player | epubreader | en_EN |
| dtk.purchase | TÁMOP-4.1.2.A/1-11/1-2011-0103 Debreceni Egyetem | en_EN |
| dtk.size | 2014 - 2019 | en_EN |
| dtk.size | Magyarország | en_EN |
| dtk.type | book | en_EN |
| dtk.udc | ---- MAIN TABLES::0 SCIENCE AND KNOWLEDGE. ORGANIZATION. COMPUTER SCIENCE. INFORMATION. DOCUMENTATION. LIBRARIANSHIP. INSTITUTIONS. PUBLICATIONS::004 Computer science and technology. Computing. Data processing::004.4 Software::004.43 Computer languages | en_EN |
| dtk.udc | ---- MAIN TABLES::0 SCIENCE AND KNOWLEDGE. ORGANIZATION. COMPUTER SCIENCE. INFORMATION. DOCUMENTATION. LIBRARIANSHIP. INSTITUTIONS. PUBLICATIONS::008 Civilization. Culture. Progress::81 Linguistics and languages::811 Languages::811.1/.9 All languages natural or artificial::811.9 Artificial languages | en_EN |
