EN | DE
Theoretische Informatik

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

urbat [2018/08/10 16:47]
urbat
urbat [2019/05/16 15:16] (current)
urbat
Line 6: Line 6:
  
 ==== About me ==== ==== About me ====
-I am a postdoctoral researcher in the [[https://www8.cs.fau.de|Theoretical Computer Science]] group at Friedrich-Alexander-Universität Erlangen-Nürnberg. My research focuses on categorical and coalgebraic structures in computer science, in particular+I am a postdoctoral researcher in the [[https://www8.cs.fau.de|Theoretical Computer Science]] group at Friedrich-Alexander-Universität Erlangen-Nürnberg. My work focuses on categorical structures in computer science, including
-  * Duality theory for formal languages+  * Algebraic and coalgebraic automata theory
   * Semantics of recursion and iteration   * Semantics of recursion and iteration
   * Monad-based verification logics   * Monad-based verification logics
Line 13: Line 13:
  
 ==== Publications ==== ==== Publications ====
 +  - Henning Urbat, Stefan Milius: ** [[http://www8.cs.fau.de/_media/research:papers:varietiesofdatalanguages.pdf|Varieties of data languages.]] ** Proc. 46th International Colloquium on Automata, Languages and Programming (ICALP 2019), Leibniz International Proceedings in Informatics (LIPIcs).
 +  - Stefan Milius, Henning Urbat: ** [[http://www8.cs.fau.de/_media/research:papers:equationalaxiomatizationfoalgebraswithstructure.pdf|Equational axiomatization of algebras with structure.]] ** Proc. 22nd International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2019), pp. 400--417
 +  - Jirí Adámek, Stefan Milius, Robert Myers, Henning Urbat: **[[http://www8.cs.fau.de/_media/research:papers:generalizedeilenbergtheorem.pdf|Generalized Eilenberg Theorem: Varieties of languages in a category.]] **ACM Trans. Comput. Logic, Vol, 20(1), pp. 3:1--3:47, 2019. [[http://www8.cs.fau.de/_media/research:papers:generalizedeilenbergtheorem_appendix.pdf|+ Appendix]]
   - Jirí Adámek, Stefan Milius, Henning Urbat: **[[http://www8.cs.fau.de/_media/research:papers:acategoricalapproachtosyntacticmonoids.pdf|A categorical approach to syntactic monoids.]] **Logical Methods in Computer Science, Vol. 14(2:9), pp. 1–34, 2018   - Jirí Adámek, Stefan Milius, Henning Urbat: **[[http://www8.cs.fau.de/_media/research:papers:acategoricalapproachtosyntacticmonoids.pdf|A categorical approach to syntactic monoids.]] **Logical Methods in Computer Science, Vol. 14(2:9), pp. 1–34, 2018
-  - Stefan Milius, Jirí Adámek, Henning Urbat: **[[http://www8.cs.fau.de/_media/research:papers:onalgebraswitheffectfuliteration.pdf|On algebras with effectful iteration.]]** Proc. Fourteenth International Workshop on Coalgebraic Methods in Computer Science (CMCS 2018), Lecture Notes Comput. Sci. +  - Stefan Milius, Jirí Adámek, Henning Urbat: **[[http://www8.cs.fau.de/_media/research:papers:onalgebraswitheffectfuliteration.pdf|On algebras with effectful iteration.]]** Proc. Fourteenth International Workshop on Coalgebraic Methods in Computer Science (CMCS 2018), Lecture Notes Comput. Sci., pp. 144-166 
-  - Henning Urbat, Jirí Adámek, Liang-Ting Chen, Stefan Milius: **[[http://www8.cs.fau.de/_media/research:papers:eilenbergtheoremsforfree.pdf|Eilenberg theorems for free.]]** ** EATCS Best paper award. ** Proc. 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Leibniz International Proceedings in Informatics (LIPIcs). [[https://arxiv.org/abs/1602.05831|Extended ArXiv version]] +  - Henning Urbat, Jirí Adámek, Liang-Ting Chen, Stefan Milius: **[[http://www8.cs.fau.de/_media/research:papers:eilenbergtheoremsforfree.pdf|Eilenberg theorems for free.]]** ** EATCS Best paper award. ** Proc. 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), pp43:1-43:14 [[https://arxiv.org/abs/1602.05831|Extended ArXiv version]] 
-  - Henning Urbat: **[[http://www8.cs.fau.de/_media/research:papers:finitebehavioursandfinitarycorecursion.pdf|Finite behaviours and finitary corecursion.]]** Proc. 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017), Leibniz International Proceedings in Informatics (LIPIcs) +  - Henning Urbat: **[[http://www8.cs.fau.de/_media/research:papers:finitebehavioursandfinitarycorecursion.pdf|Finite behaviours and finitary corecursion.]]** Proc. 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017), Leibniz International Proceedings in Informatics (LIPIcs), pp. 24:1-24:14 
-  - Liang-Ting Chen, Henning Urbat: **[[http://www8.cs.fau.de/_media/research:papers:schuetzenbergerproductsinacategory.pdf|Schützenberger products in a category.]]** Proc. Developments in Language Theory (DLT 2016), 89-101+  - Liang-Ting Chen, Henning Urbat: **[[http://www8.cs.fau.de/_media/research:papers:schuetzenbergerproductsinacategory.pdf|Schützenberger products in a category.]]** Proc. 20th International Conference on Developments in Language Theory (DLT 2016), pp. 89-101
   - Jirí Adámek, Liang-Ting Chen, Stefan Milius, Henning Urbat: **[[http://www8.cs.fau.de/_media/research:papers:profinitemonadsprofiniteequationsandreitermanstheorem.pdf|Profinite monads, profinite equations, and Reiterman's theorem.]]** Proc. Ninteenth International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2016), 531-547   - Jirí Adámek, Liang-Ting Chen, Stefan Milius, Henning Urbat: **[[http://www8.cs.fau.de/_media/research:papers:profinitemonadsprofiniteequationsandreitermanstheorem.pdf|Profinite monads, profinite equations, and Reiterman's theorem.]]** Proc. Ninteenth International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2016), 531-547
   - Jirí Adámek, Stefan Milius, Robert Myers, Henning Urbat: **[[http://www8.cs.fau.de/_media/research:papers:varietiesoflanguagesinacategory_lics2015.pdf|Varieties of languages in a category.]]** Proc. 30th Annual Symposium on Logic in Computer Science (LICS 2015), pp. 414-425, IEEE 2015   - Jirí Adámek, Stefan Milius, Robert Myers, Henning Urbat: **[[http://www8.cs.fau.de/_media/research:papers:varietiesoflanguagesinacategory_lics2015.pdf|Varieties of languages in a category.]]** Proc. 30th Annual Symposium on Logic in Computer Science (LICS 2015), pp. 414-425, IEEE 2015
Line 30: Line 33:
  
 ==== Scientific Talks ==== ==== Scientific Talks ====
 +  - // Varieties of data languages.// ICALP 2019, Patras, Greece, July 2019
 +  - // Automata learning: An algebraic approach. // CALCO 2019, London, England, June 2019
 +  - // A categorical approach to algebraic language theory.// GI-Kolloquium, Schloss Dagstuhl, Germany, May 2019
 +  - // Equational axiomatization of algebras with structure.// FOSSACS 2019, Prague, Czech Republic, April 2019
   - // Eilenberg theorems for free.// HIGHLIGHTS 2018, Berlin, Germany, September 2018   - // Eilenberg theorems for free.// HIGHLIGHTS 2018, Berlin, Germany, September 2018
   - // Finite behaviours and finitary corecursion.// CALCO 2017, Ljubljana, Slovenia, June 2017   - // Finite behaviours and finitary corecursion.// CALCO 2017, Ljubljana, Slovenia, June 2017
Line 46: Line 53:
  
   * Fourteenth International Workshop on Coalgebraic Methods in Computer Science (CMCS 2018), PC member   * Fourteenth International Workshop on Coalgebraic Methods in Computer Science (CMCS 2018), PC member
-  * Reviewer for conferences (CONCUR 2018, DLT 2018, CMCS 2018, CALCO 2017, FOSSACS 2017, MFCS 2016, MFPS 2016, ICALP 2016, LICS 2016, CALCO 2015) and journals (Houston Journal of Mathematics, Journal of Pure and Applied Algebra, Logical Methods in Computer Science)+  * Reviewer for conferences (CALCO 2019, CONCUR 2018, DLT 2018, CMCS 2018, CALCO 2017, FOSSACS 2017, MFCS 2016, MFPS 2016, ICALP 2016, LICS 2016, CALCO 2015) and journals (Applicable Algebra in Engineering, Communication and Computing, Houston Journal of Mathematics, Journal of Pure and Applied Algebra, Logical Methods in Computer Science)
  
 ==== Teaching ==== ==== Teaching ====
  
-In winter term 2018/2019 I will be teaching the course [[course:aloa|Algebraic and Logical Aspects of Automata Theory]] (in German). Previously I (co-)taught the following courses:+In winter term 2019/2020 I will be teaching the course [[course:algprog|Algebra of Programming]]. Previously I (co-)taught the following courses: 
 +  * [[course:aloa|Algebraic and Logical Aspects of Automata Theory]]
   * Automata and Formal Languages   * Automata and Formal Languages
   * Computability and Complexity   * Computability and Complexity