Talks & Seminars
Title: Jumping Finite Automata
Prof. Alexander Meduna, Brno University of Technology
Date & Time: August 28, 2019 11:30
Venue: Department of Computer Science and Engineering, Conference Room, 01st Floor, Kanwal Rekhi (KReSIT) Building
This talk proposes a new investigation area in automata theory - jumping finite automata. These automata work like classical finite automata except that they read input words discontinuously - that is, after reading a symbol, they can jump over some symbols within the words and continue their computation from there. The talk gives several results concerning jumping finite automata in terms of commonly investigated areas of automata theory, such as closure properties. Most importantly, it achieves several results that demonstrate differences between jumping finite automata and classical finite automata. In its conclusion, the talk formulates several open problems and suggests future investigation areas.
Speaker Profile:
Prof. Alexander Meduna (born 1957 in Olomouc, Czech Republic) is a theoretical computer scientist and expert on compiler design, formal languages and automata. He is a professor of Computer Science at the Brno University of Technology. Formerly, he taught theoretical computer science at various European and American universities, including the University of Missouri, where he spent a decade teaching advanced topics of formal language theory. He wrote over ninety papers related to theoretical computer scientist. His latest book is - Meduna, Alexander; Tomko, Martin, Horacek, Petr (2019). Handbook of Mathematical Models for Languages and Computation. The Institution of Engineering and Technology, Stevenage, UK, ISBN: 978-1-78561-660-0 (https://www.amazon.ae/Handbook-Mathematical-Models-Languages-Computation/dp/1785616595)
List of Talks


Faculty CSE IT
Forgot Password
    [+] Sitemap     Feedback