Navigation

Dr. Henning Urbat

FAU Erlangen-Nürnberg
Lehrstuhl für Informatik 8 (Theoretische Informatik)
Martensstraße 3
D-91058 Erlangen
Office: 11.157
E-Mail: henning.urbat[at]fau.de
Phone: 0049-9131/85-64030

About me

I am a postdoctoral researcher in the Theoretical Computer Science group at Friedrich-Alexander-Universität Erlangen-Nürnberg. My work focuses on categorical structures in computer science, including:

  • Algebraic and coalgebraic automata theory
  • Semantics of recursion and iteration
  • Logic and verification

My position is funded by the DFG project CoMoC.

Publications (see also dblp)

  1. Robert Myers, Henning Urbat: Syntactic minimization of nondeterministic finite automata. Proc. 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), Leibniz International Proceedings in Informatics (LIPIcs), vol. 202, pp. 78:1–78:16, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2021.
  2. Henning Urbat, Daniel Hausmann, Stefan Milius, Lutz Schröder: Nominal Büchi automata with name allocation. Proc. 32nd International Conference on Concurrency Theory (CONCUR 2021), Leibniz International Proceedings in Informatics (LIPIcs), vol. 203, pp. 4:1–4:16, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2021.
  3. Jiri Adamek, Liang-Ting Chen, Stefan Milius, Henning Urbat: Reiterman’s theorem on finite algebras for a monad. ACM Trans. Comput. Logic, Vol. 22(3), pp. 23:1–23:48, 2021
  4. Jiri Adamek, Stefan Milius, Henning Urbat: On the behaviour of coalgebras with side effects and algebras with effectful iteration. J. Log. Comput., vol. 31(6), pp. 1429–1481, Oxford University Press, 2021.
  5. Stefan Milius, Robert Myers, Henning Urbat: Nondeterministic syntactic complexity. Proc. 24th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2021), Lect. Notes Comput. Sci., vol. 12650, pp. 448–468, Springer, 2021.
  6. Fabian Birkmann, Stefan Milius, Henning Urbat: On language varieties without boolean operations. Proc. 14th-15th International Conference on Language and Automata Theory and Applications (LATA 2020-2021), Lect. Notes Comput. Sci., vol. 12638, pp. 3–15, Springer, 2021.
  7. Henning Urbat, Lutz Schröder: Automata learning: An algebraic approach. Proc. 35th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2020), pp. 900–914, ACM, 2020.
  8. Henning Urbat, Stefan Milius: Varieties of data languages. Proc. 46th International Colloquium on Automata, Languages and Programming (ICALP 2019), Leibniz International Proceedings in Informatics (LIPIcs), vol. 132, pp. 130:1–130:14, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2019.
  9. Stefan Milius, Henning Urbat: Equational axiomatization of algebras with structure. Proc. 22nd International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2019), Lect. Notes Comput. Sci., vol. 11425, pp. 400–417, Springer, 2019.
  10. Jirí Adámek, Stefan Milius, Robert Myers, Henning Urbat: Generalized Eilenberg Theorem: Varieties of languages in a category. ACM Trans. Comput. Logic, Vol. 20(1), pp. 3:1–3:47, 2019. + Appendix
  11. Jirí Adámek, Stefan Milius, Henning Urbat: A categorical approach to syntactic monoids. Log. Methods Comput. Sci., vol. 14(2:9), pp. 1–34, 2018.
  12. Stefan Milius, Jirí Adámek, Henning Urbat: On algebras with effectful iteration. Proc. 14th International Workshop on Coalgebraic Methods in Computer Science (CMCS 2018), Lect. Notes Comput. Sci., vol. 11020, pp. 144–166, Springer, 2018.
  13. Henning Urbat, Jirí Adámek, Liang-Ting Chen, Stefan Milius: 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), vol. 83, pp. 43:1–43:14, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2017. — Extended ArXiv version
  14. Henning Urbat: Finite behaviours and finitary corecursion. Proc. 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017), Leibniz International Proceedings in Informatics (LIPIcs), vol. 72, pp. 24:1–24:14, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2017.
  15. Liang-Ting Chen, Henning Urbat: Schützenberger products in a category. Proc. 20th International Conference on Developments in Language Theory (DLT 2016), Lect. Notes Comput. Sci., vol. 9840, pp. 89–101, Springer, 2016.
  16. Jirí Adámek, Liang-Ting Chen, Stefan Milius, Henning Urbat: Profinite monads, profinite equations, and Reiterman’s theorem. Proc. 19th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2016), Lect. Notes Comput. Sci., vol. 9634, pp. 531–547, Springer, 2016.
  17. Jirí Adámek, Stefan Milius, Robert Myers, Henning Urbat: Varieties of languages in a category. Proc. 30th Annual Symposium on Logic in Computer Science (LICS 2015), pp. 414–425, IEEE, 2015.
  18. Jirí Adámek, Stefan Milius, Henning Urbat: Syntactic monoids in a category. Best paper award. Proc. 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), Leibniz International Proceedings in Informatics (LIPIcs), vol. 35, pp. 1–16, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2015.
  19. Liang-Ting Chen, Henning Urbat: A fibrational approach to automata theory. Proc. 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), Leibniz International Proceedings in Informatics (LIPIcs), vol. 35, pp. 50–65, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2015.
  20. Jirí Adámek, Stefan Milius, Robert Myers, Henning Urbat: Coalgebraic constructions of canonical nondeterministic automata. Theor. Comp. Sci., vol. 604, pp. 81–101, Elsevier, 2015.
  21. Jirí Adámek, Stefan Milius, Lawrence S. Moss, Henning Urbat: On finitary functors and their presentation. J. Comput. System Sci., vol. 81 (5), pp. 813–833, Elsevier, 2015.
  22. Jirí Adámek, Stefan Milius, Robert Myers, Henning Urbat: On continuous nondeterminism and state minimality. Proc. 30th Conference on Mathematical Foundations of Programming Semantics (MFPS 2014), Electron. Notes Theor. Comput. Sci., vol. 308, pp. 3–23, Elsevier, 2014.
  23. Jirí Adámek, Stefan Milius, Robert Myers, Henning Urbat: Canonical nondeterministic automata. Proc. 12th International Workshop on Coalgebraic Methods in Computer Science (CMCS 2014), Lect. Notes Comput. Sci., vol. 8446, pp. 189–210, Springer, 2014.
  24. Jirí Adámek, Stefan Milius, Robert Myers, Henning Urbat: Generalized Eilenberg Theorem I: Local varieties of languages. Proc. 17th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2014), Lect. Notes Comput. Sci., vol. 8412, pp. 366–380, Springer, 2014.
  25. Robert Myers, Henning Urbat: A characterisation of NL/poly via nondeterministic finite automata. Proc. 15th International Workshop on Descriptional Complexity of Formal Systems (DCFS 2013), Lect. Notes Comput. Sci., vol. 8031, pp. 19–204, Springer, 2013.

Scientific Talks

  1. Quantum automata and basic varieties of languages. 31. Theorietag “Automaten und Formale Sprachen”, Leipzig, Germany, September 2021
  2. On language varieties without boolean operations. LATA 2020-2021, Milano, Italy, September 2021
  3. Syntactic minimization of nondeterministic finite automata. MFCS 2021, Tallinn, Estonia, August 2021
  4. Nominal Büchi automata with name allocation. CONCUR 2021, Paris, France, August 2021
  5. Automata learning: An algebraic approach. LICS 2020, Saarbrücken, Germany, July 2020
  6. Automata learning: An algebraic approach. Automata Theory Seminar, Université Paris-Diderot, France, March 2020
  7. Varieties of data languages. ICALP 2019, Patras, Greece, July 2019
  8. Automata learning: An algebraic approach. CALCO 2019, London, England, June 2019
  9. A categorical approach to algebraic language theory. GI-Kolloquium, Schloss Dagstuhl, Germany, May 2019
  10. Equational axiomatization of algebras with structure. FOSSACS 2019, Prague, Czech Republic, April 2019
  11. Eilenberg theorems for free. HIGHLIGHTS 2018, Berlin, Germany, September 2018
  12. Finite behaviours and finitary corecursion. CALCO 2017, Ljubljana, Slovenia, June 2017
  13. Eilenberg-Reiterman theory for a monad. Logic Colloquium 2016, Leeds, England, August 2016
  14. Schützenberger products in a category. DLT 2016, Montreal, Canada, July 2016
  15. Algebraic language theory = monads + duality. CMCS 2016, Eindhoven, Netherlands, April 2016
  16. Algebraic language theory = monads + duality. PSSL 99, Braunschweig, Germany, March 2016
  17. Varieties of languages in a category. LICS 2015, Kyoto, Japan, July 2015
  18. Syntactic monoids in a category. CALCO 2015, Nijmegen, Netherlands, June 2015
  19. On continuous nondeterminism and state minimality. MFPS 2014, Ithaca, United States, June 2014
  20. Canonical nondeterministic automata. CMCS 2014, Grenoble, France, April 2014
  21. A characterisation of NL/poly via nondeterministic finite automata. DCFS 2013, London, Canada, July 2013
  22. Two finitary functors. Dagstuhl seminar “Coalgebraic Logics”, Schloss Dagstuhl, Germany, October 2012

Professional Activitivies

  • Program committees:
    • 37th Annual Symposium on Logic in Computer Science (LICS 2022), PC member
    • 15th International Workshop on Coalgebraic Methods in Computer Science (CMCS 2020), PC member
    • 14th International Workshop on Coalgebraic Methods in Computer Science (CMCS 2018), PC member
  • Reviewer for conferences:
    MFPS 2021, MFCS 2021, CONCUR 2021, CPP 2021, CSL 2021, MFCS 2020, ICALP 2020, FOSSACS 2020, CMCS 2020, CALCO 2019, CONCUR 2018, DLT 2018, CMCS 2018, CALCO 2017, FOSSACS 2017, MFCS 2016, MFPS 2016, ICALP 2016, LICS 2016, CALCO 2015.
  • Reviewer for journals:
    Applied Categorical Structures, Applicable Algebra in Engineering, Communication and Computing, Compositionality, Houston Journal of Mathematics, Information and Computation, Journal of Computer and System Sciences, Journal of Pure and Applied Algebra, Logical Methods in Computer Science.

Teaching

Courses taught at FAU:

Previously I (co-)taught the following courses:

  • Automata and Formal Languages
  • Computability and Complexity
  • Introduction to Logic
  • Formal Verification
  • Algebra of Programming