{"id":11183,"date":"2022-04-01T12:23:57","date_gmt":"2022-04-01T12:23:57","guid":{"rendered":"https:\/\/dei.fe.up.pt\/dev\/?p=11183"},"modified":"2022-04-01T12:47:59","modified_gmt":"2022-04-01T12:47:59","slug":"dei-talks-jumping-finite-automata-por-prof-alexander-meduna","status":"publish","type":"post","link":"https:\/\/dei.fe.up.pt\/dev\/dei-talks-jumping-finite-automata-por-prof-alexander-meduna\/","title":{"rendered":"DEI Talks | JUMPING FINITE AUTOMATA por Prof. Alexander Meduna"},"content":{"rendered":"<p>Prof. <strong><a href=\"https:\/\/www.fit.vut.cz\/person\/meduna\/.en\">Alexander Meduna<\/a><\/strong> (nascido em 1957 em Olomouc, Rep\u00fablica Checa) \u00e9 um cientista inform\u00e1tico te\u00f3rico e especialista em desenho de compiladores, linguagens formais e aut\u00f3matos. \u00c9 professor de Inform\u00e1tica na Brno University of Technology.<\/p>\n<p>Anteriormente, ensinou inform\u00e1tica te\u00f3rica em v\u00e1rias universidades europeias e americanas, incluindo a Universidade do Missouri, onde passou uma d\u00e9cada a ensinar t\u00f3picos avan\u00e7ados de teoria da linguagem formal. Escreveu mais de noventa artigos relacionados com teoria da computa\u00e7\u00e3o.<\/p>\n<p>Junte-se a n\u00f3s no dia <strong>7 de Abril<\/strong>, \u00e0s <strong>14:30<\/strong>, na sala <strong>I-105<\/strong> da FEUP, para a apresenta\u00e7\u00e3o de <a href=\"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054112500244\">JUMPING FINITE AUTOMATA<\/a><\/p>\n<p><strong>Abstract: <\/strong><\/p>\n<p>This talk proposes a new investigation area in automata theory \u2014 <em>jumping finite automata<\/em>. These automata work like classical finite automata except that they read input words discontinuously \u2014 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&nbsp; formulates several open problems and suggests future investigation areas.<\/p>\n<p>O seu \u00faltimo livro \u00e9 o <em>Handbook of Mathematical Models for Languages and Computation<\/em><\/p>\n<p>Meduna, Alexander; Tomko, Martin, Horacek, Petr (2019)<\/p>\n<p>The Institution of Engineering and Technology, Stevenage, UK, ISBN: 978-1-78561-660-0<\/p>\n<p><a href=\"https:\/\/www.amazon.ae\/Handbook-Mathematical-Models-Languages-Computation\/dp\/1785616595\">https:\/\/www.amazon.ae\/Handbook-Mathematical-Models-Languages-Computation\/dp\/1785616595<\/a><\/p>\n<p>Alguns dos livros anteriores:<\/p>\n<ul>\n<li>Meduna, Alexander (2000).&nbsp;Automata and Languages: Theory and Applications. Springer Science &amp; Business Media.&nbsp;<a href=\"https:\/\/en.wikipedia.org\/wiki\/International_Standard_Book_Number\">ISBN<\/a>&nbsp;<a href=\"https:\/\/en.wikipedia.org\/wiki\/Special:BookSources\/9781852330743\">9781852330743<\/a>.<\/li>\n<li>Meduna, Alexander (2007).&nbsp;Elements of Compiler Design. CRC Press.&nbsp;<a href=\"https:\/\/en.wikipedia.org\/wiki\/International_Standard_Book_Number\">ISBN<\/a>&nbsp;<a href=\"https:\/\/en.wikipedia.org\/wiki\/Special:BookSources\/9781420063233\">9781420063233<\/a>.<\/li>\n<li>Meduna, Alexander (2014).&nbsp;Formal Languages and Computation: Models and Their Applications. CRC Press.&nbsp;<a href=\"https:\/\/en.wikipedia.org\/wiki\/International_Standard_Book_Number\">ISBN<\/a>&nbsp;<a href=\"https:\/\/en.wikipedia.org\/wiki\/Special:BookSources\/9781466513457\">9781466513457<\/a>.<\/li>\n<li>Meduna, Alexander; \u0160vec, Martin (2005).&nbsp;Grammars with Context Conditions and Their Applications. John Wiley &amp; Sons.&nbsp;<a href=\"https:\/\/en.wikipedia.org\/wiki\/International_Standard_Book_Number\">ISBN<\/a>&nbsp;<a href=\"https:\/\/en.wikipedia.org\/wiki\/Special:BookSources\/9780471736554\">9780471736554<\/a>.<\/li>\n<li>Meduna, Alexander; Techet, Ji\u0159\u00ed (2010).&nbsp;Scattered Context Grammars and Their Applications. WIT Press.&nbsp;<a href=\"https:\/\/en.wikipedia.org\/wiki\/International_Standard_Book_Number\">ISBN<\/a>&nbsp;<a href=\"https:\/\/en.wikipedia.org\/wiki\/Special:BookSources\/9781845644260\">9781845644260<\/a>.<\/li>\n<li>Meduna, Alexander; Zemek, Petr (2014).&nbsp;Regulated Grammars and Automata. Springer.&nbsp;<a href=\"https:\/\/en.wikipedia.org\/wiki\/International_Standard_Book_Number\">ISBN<\/a>&nbsp;<a href=\"https:\/\/en.wikipedia.org\/wiki\/Special:BookSources\/9781493903696\">9781493903696<\/a>.<\/li>\n<li>Meduna, Alexander; Soukup, Ond\u0159ej (2017).&nbsp;Modern Language Models and Computation: Theory with Applications. Springer.&nbsp;<a href=\"https:\/\/en.wikipedia.org\/wiki\/International_Standard_Book_Number\">ISBN<\/a>&nbsp;<a href=\"https:\/\/en.wikipedia.org\/wiki\/Special:BookSources\/9783319630991\">9783319630991<\/a>.<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Prof. Alexander Meduna (nascido em 1957 em Olomouc, Rep\u00fablica Checa) \u00e9 um cientista inform\u00e1tico te\u00f3rico e especialista em desenho de compiladores, linguagens formais e aut\u00f3matos. \u00c9 professor de Inform\u00e1tica na Brno University of Technology. Anteriormente, ensinou inform\u00e1tica te\u00f3rica em v\u00e1rias universidades europeias e americanas, incluindo a Universidade do Missouri, onde passou uma d\u00e9cada a ensinar [&hellip;]<\/p>\n","protected":false},"author":60,"featured_media":11189,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"inline_featured_image":false,"footnotes":""},"categories":[114,46,22,20],"tags":[],"class_list":["post-11183","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-dei-talks","category-destaque","category-eventos","category-noticias"],"_links":{"self":[{"href":"https:\/\/dei.fe.up.pt\/dev\/wp-json\/wp\/v2\/posts\/11183","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/dei.fe.up.pt\/dev\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/dei.fe.up.pt\/dev\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/dei.fe.up.pt\/dev\/wp-json\/wp\/v2\/users\/60"}],"replies":[{"embeddable":true,"href":"https:\/\/dei.fe.up.pt\/dev\/wp-json\/wp\/v2\/comments?post=11183"}],"version-history":[{"count":0,"href":"https:\/\/dei.fe.up.pt\/dev\/wp-json\/wp\/v2\/posts\/11183\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/dei.fe.up.pt\/dev\/wp-json\/wp\/v2\/media\/11189"}],"wp:attachment":[{"href":"https:\/\/dei.fe.up.pt\/dev\/wp-json\/wp\/v2\/media?parent=11183"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/dei.fe.up.pt\/dev\/wp-json\/wp\/v2\/categories?post=11183"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/dei.fe.up.pt\/dev\/wp-json\/wp\/v2\/tags?post=11183"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}