default search action
Henning Urbat
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c28]Sergey Goncharov, Alessio Santamaria
, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Logical Predicates in Higher-Order Mathematical Operational Semantics. FoSSaCS (2) 2024: 47-69 - [c27]Fabian Birkmann
Monoidal Extended Stone Duality. FoSSaCS (1) 2024: 144-165 - [c26]Sergey Goncharov
Bialgebraic Reasoning on Higher-order Program Equivalence. LICS 2024: 39:1-39:15 - [e1]Barbara König
Coalgebraic Methods in Computer Science - 17th IFIP WG 1.3 International Workshop, CMCS 2024, Colocated with ETAPS 2024, Luxembourg City, Luxembourg, April 6-7, 2024, Proceedings. Lecture Notes in Computer Science 14617, Springer 2024, ISBN 978-3-031-66437-3 [contents] - [i29]Sergey Goncharov, Alessio Santamaria
Logical Predicates in Higher-Order Mathematical Operational Semantics. CoRR abs/2401.05872 (2024) - [i28]Fabian Birkmann, Henning Urbat, Stefan Milius:
Monoidal Extended Stone Duality. CoRR abs/2401.08219 (2024) - [i27]Jan Jurka, Stefan Milius, Henning Urbat:
Algebraic Reasoning over Relational Structures. CoRR abs/2401.08445 (2024) - [i26]Sergey Goncharov, Stefan Milius, Stelios Tsampas, Henning Urbat:
Bialgebraic Reasoning on Higher-Order Program Equivalence. CoRR abs/2402.00625 (2024) - [i25]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Higher-Order Mathematical Operational Semantics. CoRR abs/2405.16708 (2024) - [i24]Florian Frank, Daniel Hausmann, Stefan Milius, Lutz Schröder, Henning Urbat:
Alternating Nominal Automata with Name Allocation. CoRR abs/2408.03658 (2024) - 2023
- [j8]Fabian Birkmann, Stefan Milius
Eilenberg's variety theorem without Boolean operations. Inf. Comput. 295(Part B): 104916 (2023) - [j7]Sergey Goncharov
Towards a Higher-Order Mathematical Operational Semantics. Proc. ACM Program. Lang. 7(POPL): 632-658 (2023) - [c25]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Higher-Order Mathematical Operational Semantics (Early Ideas). CALCO 2023: 24:1-24:3 - [c24]Fabian Birkmann, Stefan Milius, Henning Urbat:
Nominal Topology for Data Languages. ICALP 2023: 114:1-114:21 - [c23]Henning Urbat, Stelios Tsampas
Weak Similarity in Higher-Order Mathematical Operational Semantics. LICS 2023: 1-13 - [c22]Florian Frank
Positive Data Languages. MFCS 2023: 48:1-48:15 - [i23]Henning Urbat, Stelios Tsampas, Sergey Goncharov, Stefan Milius, Lutz Schröder:
Weak Similarity in Higher-Order Mathematical Operational Semantics. CoRR abs/2302.08200 (2023) - [i22]Florian Frank, Stefan Milius, Henning Urbat:
Positive Data Languages. CoRR abs/2304.12947 (2023) - [i21]Henning Urbat, Stefan Milius, Fabian Birkmann:
Nominal Topology for Data Languages. CoRR abs/2304.13337 (2023) - 2022
- [c21]Florian Frank
Coalgebraic Semantics for Nominal Automata. CMCS 2022: 45-66 - [c20]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas
Stateful Structural Operational Semantics. FSCD 2022: 30:1-30:19 - [i20]Florian Frank, Stefan Milius, Henning Urbat:
Coalgebraic Semantics for Nominal Automata. CoRR abs/2202.06546 (2022) - [i19]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Stateful Structural Operational Semantics. CoRR abs/2202.10866 (2022) - [i18]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Towards a Higher-Order Mathematical Operational Semantics. CoRR abs/2210.13387 (2022) - 2021
- [j6]Jirí Adámek, Stefan Milius, Henning Urbat:
On the behaviour of coalgebras with side effects and algebras with effectful iteration. J. Log. Comput. 31(6): 1429-1481 (2021) - [j5]Jirí Adámek, Liang-Ting Chen
Reiterman's Theorem on Finite Algebras for a Monad. ACM Trans. Comput. Log. 22(4): 23:1-23:48 (2021) - [c19]Henning Urbat, Daniel Hausmann
Nominal Büchi Automata with Name Allocation. CONCUR 2021: 4:1-4:16 - [c18]Robert S. R. Myers, Stefan Milius, Henning Urbat:
Nondeterministic Syntactic Complexity. FoSSaCS 2021: 448-468 - [c17]Fabian Birkmann, Stefan Milius
On Language Varieties Without Boolean Operations. LATA 2021: 3-15 - [c16]Robert S. R. Myers, Henning Urbat:
Syntactic Minimization Of Nondeterministic Finite Automata. MFCS 2021: 78:1-78:16 - [i17]Jirí Adámek, Liang-Ting Chen, Stefan Milius, Henning Urbat:
Reiterman's Theorem on Finite Algebras for a Monad. CoRR abs/2101.00942 (2021) - [i16]Robert S. R. Myers, Stefan Milius, Henning Urbat:
Nondeterministic Syntactic Complexity. CoRR abs/2101.03039 (2021) - [i15]Henning Urbat, Daniel Hausmann, Stefan Milius, Lutz Schröder:
Nominal Büchi Automata with Name Allocation. CoRR abs/2107.03213 (2021) - [i14]Robert Samuel Ralph Myers, Henning Urbat:
Syntactic Minimization of Nondeterministic Finite Automata. CoRR abs/2107.03229 (2021) - 2020
- [c15]Henning Urbat, Lutz Schröder
Automata Learning: An Algebraic Approach. LICS 2020: 900-914 - [i13]Fabian Birkmann, Stefan Milius, Henning Urbat:
On Language Varieties Without Boolean Operations. CoRR abs/2011.06951 (2020)
2010 – 2019
- 2019
- [j4]Jirí Adámek, Stefan Milius, Robert S. R. Myers, Henning Urbat:
Generalized Eilenberg Theorem: Varieties of Languages in a Category. ACM Trans. Comput. Log. 20(1): 3:1-3:47 (2019) - [c14]Stefan Milius, Henning Urbat:
Equational Axiomatization of Algebras with Structure. FoSSaCS 2019: 400-417 - [c13]Henning Urbat, Stefan Milius:
Varieties of Data Languages. ICALP 2019: 130:1-130:14 - [i12]Henning Urbat, Stefan Milius:
Varieties of Data Languages. CoRR abs/1903.08053 (2019) - [i11]Henning Urbat, Lutz Schröder:
Automata Learning: An Algebraic Approach. CoRR abs/1911.00874 (2019) - [i10]Stefan Milius, Jirí Adámek, Henning Urbat:
On the Behaviour of Coalgebras with Side Effects and Algebras with Effectful Iteration. CoRR abs/1911.06346 (2019) - 2018
- [b1]Henning Urbat:
A categorical approach to algebraic language theory. Braunschweig University of Technology, Germany, 2018 - [j3]Jirí Adámek, Stefan Milius, Henning Urbat:
A Categorical Approach to Syntactic Monoids. Log. Methods Comput. Sci. 14(2) (2018) - [c12]Stefan Milius, Jirí Adámek, Henning Urbat:
On Algebras with Effectful Iteration. CMCS 2018: 144-166 - [p1]Henning Urbat:
A Categorical Approach to Algebraic. Ausgezeichnete Informatikdissertationen 2018: 261-270 - [i9]Jirí Adámek, Stefan Milius, Henning Urbat:
A Categorical Approach to Syntactic Monoids. CoRR abs/1804.03011 (2018) - [i8]Stefan Milius, Henning Urbat:
Equational Axiomatization of Algebras with Structure. CoRR abs/1812.02016 (2018) - 2017
- [c11]Henning Urbat:
Finite Behaviours and Finitary Corecursion. CALCO 2017: 24:1-24:16 - [c10]Henning Urbat, Jirí Adámek, Liang-Ting Chen
Eilenberg Theorems for Free. MFCS 2017: 43:1-43:15 - 2016
- [c9]Liang-Ting Chen
Schützenberger Products in a Category. DLT 2016: 89-101 - [c8]Liang-Ting Chen
Profinite Monads, Profinite Equations, and Reiterman's Theorem. FoSSaCS 2016: 531-547 - [i7]Henning Urbat, Jirí Adámek, Liang-Ting Chen, Stefan Milius:
One Eilenberg Theorem to Rule Them All. CoRR abs/1602.05831 (2016) - [i6]Liang-Ting Chen, Henning Urbat:
Schützenberger Products in a Category. CoRR abs/1605.01810 (2016) - 2015
- [j2]Jirí Adámek, Stefan Milius, Lawrence S. Moss, Henning Urbat:
On finitary functors and their presentations. J. Comput. Syst. Sci. 81(5): 813-833 (2015) - [j1]Robert S. R. Myers, Jirí Adámek, Stefan Milius, Henning Urbat:
Coalgebraic constructions of canonical nondeterministic automata. Theor. Comput. Sci. 604: 81-101 (2015) - [c7]Jirí Adámek, Stefan Milius, Henning Urbat:
Syntactic Monoids in a Category. CALCO 2015: 1-16 - [c6]Liang-Ting Chen
A Fibrational Approach to Automata Theory. CALCO 2015: 50-65 - [c5]Jirí Adámek, Robert S. R. Myers, Henning Urbat, Stefan Milius:
Varieties of Languages in a Category. LICS 2015: 414-425 - [i5]Jirí Adámek, Stefan Milius, Robert S. R. Myers, Henning Urbat:
Generalized Eilenberg Theorem I: Local Varieties of Languages. CoRR abs/1501.02834 (2015) - [i4]Jirí Adámek, Stefan Milius, Robert S. R. Myers, Henning Urbat:
Varieties of Languages in a Category. CoRR abs/1501.05180 (2015) - [i3]Liang-Ting Chen, Henning Urbat:
A Fibrational Approach to Automata Theory. CoRR abs/1504.02692 (2015) - [i2]Jirí Adámek, Stefan Milius, Henning Urbat:
Syntactic Monoids in a Category. CoRR abs/1504.02694 (2015) - [i1]Liang-Ting Chen, Jirí Adámek, Stefan Milius, Henning Urbat:
Profinite Monads, Profinite Equations and Reiterman's Theorem. CoRR abs/1511.02147 (2015) - 2014
- [c4]Robert S. R. Myers, Jirí Adámek, Stefan Milius, Henning Urbat:
Canonical Nondeterministic Automata. CMCS 2014: 189-210 - [c3]Jirí Adámek, Stefan Milius, Robert S. R. Myers, Henning Urbat:
Generalized Eilenberg Theorem I: Local Varieties of Languages. FoSSaCS 2014: 366-380 - [c2]Jirí Adámek, Robert S. R. Myers, Henning Urbat, Stefan Milius:
On Continuous Nondeterminism and State Minimality. MFPS 2014: 3-23 - 2013
- [c1]Robert S. R. Myers, Henning Urbat:
A Characterisation of NL/poly via Nondeterministic Finite Automata. DCFS 2013: 194-204
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: