activity
20102016
most citedRepresenting Small Ordinals by Finite Automata

5 citations · 13 across the 9 of their papers we have counts for

collaborators

9 papers

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.FL20151 cited

*-Continuous Kleene -Algebras

Zoltán Ésik, Uli Fahrenberg, Axel Legay

We define and study basic properties of *-continuous Kleene -algebras that involve a *-continuous Kleene algebra with a *-continuous action on a semimodule and an infinite produ…

cs.FL20141 cited

Proceedings 14th International Conference on Automata and Formal Languages

Zoltán Ésik, Zoltán Fülöp

The 14th International Conference Automata and Formal Languages (AFL 2014) was held in Szeged, Hungary, from the 27th to the 29th of May, 2014. The conference was organized by the…

cs.LO20123 cited

Proceedings 8th Workshop on Fixed Points in Computer Science

Dale Miller, Zoltán Ésik

This volume contains the proceedings of the Eighth Workshop on Fixed Points in Computer Science which took place on 24 March 2012 in Tallinn, Estonia as an ETAPS-affiliated worksho…

cs.FL2010

Free inductive K-semialgebras

Zoltan Esik, Werner Kuich

We consider rational power series over an alphabet with coefficients in a ordered commutative semiring and characterize them as the free ordered -semialgebras in various…

cs.FL20105 cited

Representing Small Ordinals by Finite Automata

Zoltan Ésik

It is known that an ordinal is the order type of the lexicographic ordering of a regular language if and only if it is less than omega^omega. We design a polynomial time algorithm…