activity
20062017
most citedMinimum Model Semantics for Extensional Higher-order Logic Programming with Negation

21 citations · 84 across the 35 of their papers we have counts for

collaborators

36 papers

cs.FL2017★ 2 cited

The Triple-Pair Construction for Weighted -Pushdown Automata

Manfred Droste, Zoltán Ésik, Werner Kuich

Let S be a complete star-omega semiring and Sigma be an alphabet. For a weighted omega-pushdown automaton P with stateset 1...n, n greater or equal to 1, we show that there exists…

cs.FL2017★ 5 cited

Commutative positive varieties of languages

Jorge Almeida, Zoltán Ésik, Jean-Éric Pin

We study the commutative positive varieties of languages closed under various operations: shuffle, renaming and product over one-letter alphabets.

cs.LO2016

On Free -Continuous and Regular Ordered Algebras

Zoltan Esik, Dexter Kozen

We study varieties of certain ordered -algebras with restricted completeness and continuity properties. We give a general characterization of their free algebras in terms of sub…

cs.LO2016

Algebraic Synchronization Trees and Processes

Luca Aceto, Arnaud Carayol, Zoltán Ésik +1

We study algebraic synchronization trees, i.e., initial solutions of algebraic recursion schemes over the continuous categorical algebra of synchronization trees. In particular, we…

cs.LO2016★ 3 cited

Some Remarks on Conway and Iteration Theories

Zoltan Esik, Sergey Goncharov

We present an axiomatization of Conway theories which yields,as a corollary, a very concise axiomatization of iteration theories satisfying the functorial implication for base morp…

cs.DM2015

An analysis of the equational properties of the well-founded fixed point

Arnaud Carayol, Zoltan Esik

Well-founded fixed points have been used in several areas of knowledge representation and reasoning and to give semantics to logic programs involving negation. They are an importan…