Henning Urbat

Orcid: 0000-0002-3265-7168

According to our database1, Henning Urbat authored at least 44 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Abstract Operational Methods for Call-by-Push-Value.
CoRR, 2024

Algebraic Language Theory with Effects.
CoRR, 2024

Alternating Nominal Automata with Name Allocation.
CoRR, 2024

Higher-Order Mathematical Operational Semantics.
CoRR, 2024

Algebraic Reasoning over Relational Structures.
CoRR, 2024

Bialgebraic Reasoning on Higher-order Program Equivalence.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

Logical Predicates in Higher-Order Mathematical Operational Semantics.
Proceedings of the Foundations of Software Science and Computation Structures, 2024

Monoidal Extended Stone Duality.
Proceedings of the Foundations of Software Science and Computation Structures, 2024

2023
Eilenberg's variety theorem without Boolean operations.
Inf. Comput., December, 2023

Towards a Higher-Order Mathematical Operational Semantics.
Proc. ACM Program. Lang., January, 2023

Positive Data Languages.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Weak Similarity in Higher-Order Mathematical Operational Semantics.
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

Nominal Topology for Data Languages.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Higher-Order Mathematical Operational Semantics (Early Ideas).
Proceedings of the 10th Conference on Algebra and Coalgebra in Computer Science, 2023

2022
Stateful Structural Operational Semantics.
Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

Coalgebraic Semantics for Nominal Automata.
Proceedings of the Coalgebraic Methods in Computer Science, 2022

2021
Reiterman's Theorem on Finite Algebras for a Monad.
ACM Trans. Comput. Log., 2021

On the behaviour of coalgebras with side effects and algebras with effectful iteration.
J. Log. Comput., 2021

Syntactic Minimization Of Nondeterministic Finite Automata.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

On Language Varieties Without Boolean Operations.
Proceedings of the Language and Automata Theory and Applications, 2021

Nondeterministic Syntactic Complexity.
Proceedings of the Foundations of Software Science and Computation Structures, 2021

Nominal Büchi Automata with Name Allocation.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020
Automata Learning: An Algebraic Approach.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

2019
Generalized Eilenberg Theorem: Varieties of Languages in a Category.
ACM Trans. Comput. Log., 2019

Varieties of Data Languages.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Equational Axiomatization of Algebras with Structure.
Proceedings of the Foundations of Software Science and Computation Structures, 2019

2018
A Categorical Approach to Algebraic.
Proceedings of the Ausgezeichnete Informatikdissertationen 2018., 2018

A categorical approach to algebraic language theory.
PhD thesis, 2018

A Categorical Approach to Syntactic Monoids.
Log. Methods Comput. Sci., 2018

On Algebras with Effectful Iteration.
Proceedings of the Coalgebraic Methods in Computer Science, 2018

2017
Eilenberg Theorems for Free.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Finite Behaviours and Finitary Corecursion.
Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science, 2017

2016
One Eilenberg Theorem to Rule Them All.
CoRR, 2016

Profinite Monads, Profinite Equations, and Reiterman's Theorem.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

Schützenberger Products in a Category.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015
Coalgebraic constructions of canonical nondeterministic automata.
Theor. Comput. Sci., 2015

On finitary functors and their presentations.
J. Comput. Syst. Sci., 2015

Varieties of Languages in a Category.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

A Fibrational Approach to Automata Theory.
Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

Syntactic Monoids in a Category.
Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

2014
On Continuous Nondeterminism and State Minimality.
Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics, 2014

Generalized Eilenberg Theorem I: Local Varieties of Languages.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

Canonical Nondeterministic Automata.
Proceedings of the Coalgebraic Methods in Computer Science, 2014

2013
A Characterisation of NL/poly via Nondeterministic Finite Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2013


  Loading...