Zoltán Ésik

According to our database1, Zoltán Ésik
  • authored at least 236 papers between 1976 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Equational axioms associated with finite automata for fixed point operations in cartesian categories.
Mathematical Structures in Computer Science, 2017

An analysis of the equational properties of the well-founded fixed point.
J. Log. Algebr. Meth. Program., 2017

Commutative positive varieties of languages.
CoRR, 2017

Continuous Semiring-Semimodule Pairs and Mixed Algebraic Systems.
Acta Cybern., 2017

An Algebraic Approach to Energy Problems II - The Algebra of Energy Functions.
Acta Cybern., 2017

An Algebraic Approach to Energy Problems I - *-Continuous Kleene ω-Algebras.
Acta Cybern., 2017

Commutative Positive Varieties of Languages.
Acta Cybern., 2017

Solving Fixed Point Equations over Complete Semirings.
Proceedings of the Role of Theory in Computer Science, 2017

2016
On Free ω-Continuous and Regular Ordered Algebras.
CoRR, 2016

Some Remarks on Conway and Iteration Theories.
CoRR, 2016

Algebraic Synchronization Trees and Processes.
CoRR, 2016

Ternary Equational Languages.
Proceedings of the Implementation and Application of Automata, 2016

An Analysis of the Equational Properties of the Well-Founded Fixed Point.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

MSO-definable Properties of Muller Context-Free Languages Are Decidable.
Proceedings of the Descriptional Complexity of Formal Systems, 2016

2015
A fixed point theorem for non-monotonic functions.
Theor. Comput. Sci., 2015

Residuated Park theories.
J. Log. Comput., 2015

Preface.
Int. J. Found. Comput. Sci., 2015

*-Continuous Kleene ω-Algebras for Energy Problems.
Proceedings of the Proceedings Tenth International Workshop on Fixed Points in Computer Science, 2015

*-Continuous Kleene ω-Algebras.
CoRR, 2015

A representation theorem for stratified complete lattices.
CoRR, 2015

Equational Axioms for Fixed Point Operations.
CoRR, 2015

An analysis of the equational properties of the well-founded fixed point.
CoRR, 2015

In Memory of Professor Ferenc Gécseg.
Acta Cybern., 2015

Equational Properties of Stratified Least Fixed Points (Extended Abstract).
Proceedings of the Logic, Language, Information, and Computation, 2015

A Representation Theorem for Stratified Complete Lattices.
Proceedings of the Logic, Language, and Computation, 2015

Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

*-Continuous Kleene ω-Algebras.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

2014
Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation.
TPLP, 2014

Axiomatizing weighted synchronization trees and weighted bisimilarity.
Theor. Comput. Sci., 2014

On the Structure of Free Iteration Semirings.
Journal of Automata, Languages and Combinatorics, 2014

Operational Characterization of Scattered MCFLs.
Int. J. Found. Comput. Sci., 2014

Conway and iteration hemirings Part 2.
IJAC, 2014

Conway and iteration hemirings Part 1.
IJAC, 2014

A Fixed Point Theorem for Non-Monotonic Functions.
CoRR, 2014

Equational properties of saturated least fixed points.
CoRR, 2014

Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation.
CoRR, 2014

Theorems on Pre-fixed Points of Non-Monotonic Functions with Applications in Logic Programming and Formal Grammars.
Proceedings of the Logic, Language, Information, and Computation, 2014

On Power Series over a Graded Monoid.
Proceedings of the Computing with New Resources, 2014

2013
Free inductive K-semialgebras.
J. Log. Algebr. Program., 2013

The FC-rank of a context-free language.
Inf. Process. Lett., 2013

On Context-Free Languages of Scattered Words.
Int. J. Found. Comput. Sci., 2013

A Connection Between Concurrency and Language Theory.
Electr. Notes Theor. Comput. Sci., 2013

Operational characterization of scattered MCFLs -- Technical Report
CoRR, 2013

A connection between concurrency and language theory
CoRR, 2013

Kleene Algebras and Semimodules for Energy Problems.
CoRR, 2013

Conway and iteration hemirings.
CoRR, 2013

Operational Characterization of Scattered MCFLs.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Kleene Algebras and Semimodules for Energy Problems.
Proceedings of the Automated Technology for Verification and Analysis, 2013

2012
On Müller context-free grammars.
Theor. Comput. Sci., 2012

Ordinal Automata and Cantor Normal Form.
Int. J. Found. Comput. Sci., 2012

Preface.
Int. J. Found. Comput. Sci., 2012

The FC-rank of a context-free language
CoRR, 2012

Hausdorff Rank of Scattered Context-Free Linear Orders.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

A Context-Free Linear Ordering with an Undecidable First-Order Theory.
Proceedings of the Theoretical Computer Science, 2012

Algebraic Synchronization Trees and Processes.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

On Context-Free Languages of Scattered Words.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011
Büchi context-free languages.
Theor. Comput. Sci., 2011

Dagger extension theorem.
Mathematical Structures in Computer Science, 2011

An undecidable property of context-free linear orders.
Inf. Process. Lett., 2011

The Category of Simulations for Weighted Tree Automata.
Int. J. Found. Comput. Sci., 2011

Algebraic Linear Orderings.
Int. J. Found. Comput. Sci., 2011

Stephen L. Bloom 1940-2010.
Fundam. Inform., 2011

Multi-Linear Iterative K-Σ-Semialgebras.
Electr. Notes Theor. Comput. Sci., 2011

On context-free languages of scattered words
CoRR, 2011

Context-free ordinals
CoRR, 2011

Multi-linear iterative K-Sigma-semialgebras
CoRR, 2011

Residuated Park Theories
CoRR, 2011

Scattered context-free linear orderings
CoRR, 2011

Scattered Context-Free Linear Orderings.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

A Unifying Kleene Theorem for Weighted Finite Automata.
Proceedings of the Rainbow of Computer Science, 2011

Kleene Theorem in Partial Conway Theories with Applications.
Proceedings of the Algebraic Foundations in Computer Science, 2011

Partial Conway and Iteration Semiring-Semimodule Pairs.
Proceedings of the Algebraic Foundations in Computer Science, 2011

2010
Preface.
Theor. Comput. Sci., 2010

A Mezei-Wright theorem for categorical algebras.
Theor. Comput. Sci., 2010

Axiomatizing the equational theory of regular tree languages.
J. Log. Algebr. Program., 2010

Preface.
Int. J. Found. Comput. Sci., 2010

Algebraic Characterization of Logically Defined Tree Languages.
IJAC, 2010

Algebraic Ordinals.
Fundam. Inform., 2010

Free inductive K-semialgebras
CoRR, 2010

Representing Small Ordinals by Finite Automata
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

Free iterative and iteration K-semialgebras
CoRR, 2010

Simulations of Weighted Tree Automata
CoRR, 2010

Simulation vs. Equivalence
CoRR, 2010

An undecidable property of context-free languages
CoRR, 2010

Algebraic Linear Orderings
CoRR, 2010

Simulations of Weighted Tree Automata.
Proceedings of the Implementation and Application of Automata, 2010

Simulation vs. Equivalence.
Proceedings of the 2010 International Conference on Foundations of Computer Science, 2010

On Müller Context-Free Grammars.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009
Estimation of state complexity of combined operations.
Theor. Comput. Sci., 2009

Axiomatizing rational power series over natural numbers.
Inf. Comput., 2009

Algebraic Ordinals
CoRR, 2009

Context-Free Languages of Countable Words.
Proceedings of the Theoretical Aspects of Computing, 2009

Iteration Grove Theories with Applications.
Proceedings of the Algebraic Informatics, Third International Conference, 2009

Cycle-Free Finite Automata in Partial Iterative Semirings.
Proceedings of the Algebraic Informatics, Third International Conference, 2009

2008
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics.
Fundam. Inform., 2008

Products of Tree Automata with an Application to Temporal Logic.
Fundam. Inform., 2008

Partial Conway and Iteration Semirings.
Fundam. Inform., 2008

Games for Temporal Logics on Trees.
Proceedings of the Implementation and Applications of Automata, 2008

Iteration Semirings.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

Estimation of State Complexity of Combined Operations.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007
A Semiring-Semimodule Generalization of Transducers and Abstract omega-Families of Power Series.
Journal of Automata, Languages and Combinatorics, 2007

Boolean Fuzzy Sets.
Int. J. Found. Comput. Sci., 2007

Fuzzy tree automata.
Fuzzy Sets and Systems, 2007

Partial Conway and iteration semirings
CoRR, 2007

Axiomatizing rational power series
CoRR, 2007

Algebraic characterization of logically defined tree languages
CoRR, 2007

An Algebraic Characterization of Wolper's Logic.
Proceedings of the 2007 International Conference on Foundations of Computer Science, 2007

Regular and Algebraic Words and Ordinals.
Proceedings of the Algebra and Coalgebra in Computer Science, 2007

Aperiodicity in Tree Automata.
Proceedings of the Algebraic Informatics, Second International Conference, 2007

2006
Characterizing CTL-like logics on finite trees.
Theor. Comput. Sci., 2006

Preface.
Theor. Comput. Sci., 2006

Preface.
Theor. Comput. Sci., 2006

Cascade Products and Temporal Logics on Finite Trees.
Electr. Notes Theor. Comput. Sci., 2006

Algebraic recognizability of regular tree languages
CoRR, 2006

Preface.
Acta Cybern., 2006

Completing Categorical Algebras.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

2005
Algebraic recognizability of regular tree languages.
Theor. Comput. Sci., 2005

Guest editors' foreword: Process Algebra.
Theor. Comput. Sci., 2005

A Semiring-Semimodule Generalization of ?-Regular Languages II.
Journal of Automata, Languages and Combinatorics, 2005

A Semiring-Semimodule Generalization of ?-Regular Languages I.
Journal of Automata, Languages and Combinatorics, 2005

Algebraic and graph-theoretic properties of infinite n-posets.
ITA, 2005

The equational theory of regular words.
Inf. Comput., 2005

Algebraically complete semirings and Greibach normal form.
Ann. Pure Appl. Logic, 2005

2004
Inductive star-semirings.
Theor. Comput. Sci., 2004

Foreword.
Theor. Comput. Sci., 2004

Higher Dimensional Automata.
Journal of Automata, Languages and Combinatorics, 2004

Foreword.
ITA, 2004

Axiomatizing omega and omega-op powers of words.
ITA, 2004

An Algebraic Generalization of omega-Regular Languages.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

A Semiring-Semimodule Generalization of omega-Context-Free Languages.
Proceedings of the Theory Is Forever, 2004

2003
The max-plus algebra of the natural numbers has no finite equational basis.
Theor. Comput. Sci., 2003

Equational theories of tropical semirings.
Theor. Comput. Sci., 2003

Formal Tree Series.
Journal of Automata, Languages and Combinatorics, 2003

An Extension Theorem with an Application to Formal Tree Series.
Journal of Automata, Languages and Combinatorics, 2003

Regular languages definable by Lindström quantifiers.
ITA, 2003

Foreword.
ITA, 2003

Deciding whether the frontier of a regular tree is scattered.
Fundam. Inform., 2003

Hazard Algebras.
Formal Methods in System Design, 2003

Temporal Logic with Cyclic Counting and the Degree of Aperiodicity of Finite Automata.
Acta Cybern., 2003

On Logically Defined Recognizable Tree Languages.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

Axioms for Regular Words: Extended Abstract.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002
Axiomatizing the subsumption and subword preorders on finite and infinite partial words.
Theor. Comput. Sci., 2002

Continuous Additive Algebras and Injective Simulations of Synchronization Trees.
J. Log. Comput., 2002

Rationally Additive Semirings.
J. UCS, 2002

A Fully Equational Proof of Parikh's Theorem.
ITA, 2002

Unique, guarded fixed points in an additive setting: Extended Abstract.
Electr. Notes Theor. Comput. Sci., 2002

Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

Greibach Normal Form in Algebraically Complete Semirings.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002

Equational Axioms for Probabilistic Bisimilarity.
Proceedings of the Algebraic Methodology and Software Technology, 2002

2001
Homomorphic Simulation and Letichevsky's Criterion.
Journal of Automata, Languages and Combinatorics, 2001

On Equations for Union-Free Regular Languages.
Inf. Comput., 2001

Iteration 2-theories.
Applied Categorical Structures, 2001

Algebras for Hazard Detection.
Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic, 2001

Axiomatizing Tropical Semirings.
Proceedings of the Foundations of Software Science and Computation Structures, 2001

Automata on Series-Parallel Biposets.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

The Equational Theory of Fixed Points with Applications to Generalized Language Theory.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

A Generation of Kozen's Axiomatization of the Equational Theory of the Regular Sets.
Proceedings of the Words, Semigroups, and Transductions, 2001

2000
A proof of the Krohn-Rhodes Decomposition Theorem.
Theor. Comput. Sci., 2000

The Variety of Kleene Algebras with Conversion is not Finitely Based.
Theor. Comput. Sci., 2000

A Kleene Theorem for Lindenmayerian Algebraic Power Series.
Journal of Automata, Languages and Combinatorics, 2000

The Power of the Group-Identities for Iteration.
IJAC, 2000

On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers.
Proceedings of the STACS 2000, 2000

Iteration Theories of Boolean Functions.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Iteration Algebras Are Not Finitely Axiomatizable. Extended Abstract.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Hazard Algebras (Extended Abstract).
Proceedings of the A Half-Century of Automata Theory: Celebration and Inspiration, 2000

Axiomatizing the Least Fixed Point Operation and Binary Supremum.
Proceedings of the Computer Science Logic, 2000

1999
A Note on Equations for Commutative Regular Languages.
Inf. Process. Lett., 1999

Group Axioms for Iteration.
Inf. Comput., 1999

Axiomatizing Iteration Categories.
Acta Cybern., 1999

Series and Parallel Operations on Pomsets.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

1998
Equational Properties of Iteration in Algebraically Complete Categories.
Theor. Comput. Sci., 1998

Semantics on Flowchart Programs and the Free Conway Theories.
ITA, 1998

A Cayley Theorem for Ternary Algebras.
IJAC, 1998

Nonfinite Axiomatizability of the Equational Theory of Shuffle.
Acta Inf., 1998

Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract).
Proceedings of the STACS 98, 1998

1997
Completeness of Park Induction.
Theor. Comput. Sci., 1997

The Equational Logic of Fixed Points (Tutorial).
Theor. Comput. Sci., 1997

Varieties Generated by Languages with Poset Operations.
Mathematical Structures in Computer Science, 1997

Axiomatizing Shuffle and Concatenation in Languages.
Inf. Comput., 1997

Iteration 2-Theories: Extended Abstract.
Proceedings of the Algebraic Methodology and Software Technology, 1997

1996
Free Shuffle Algebras in Language Varieties.
Theor. Comput. Sci., 1996

Fixed-Point Operations on ccc's. Part I.
Theor. Comput. Sci., 1996

Two Axiomatizations of a Star Semiring Quasi-Variety.
Bulletin of the EATCS, 1996

Equational Properties of Iteration in Algebraically Complete Categories.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1995
Equational Properties of Kleene Algebras of Relations with Conversion.
Theor. Comput. Sci., 1995

Some Equational Laws of Initiality in 2CCC's.
Int. J. Found. Comput. Sci., 1995

Scott induction and equational proofs.
Electr. Notes Theor. Comput. Sci., 1995

Nonfinite Axiomatizability of Shuffle Inequalities.
Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

Free Shuffle Algebras in Language Varieties (Extended Abstract).
Proceedings of the LATIN '95: Theoretical Informatics, 1995

Nonfinite Axiomatizability of the Equational Theory of Shuffle.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994
Solving Polynomial Fixed Point Equations.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

1993
Iteration Theories of Synchronization Trees
Inf. Comput., January, 1993

Iteration Theories - The Equational Logic of Iterative Processes
EATCS Monographs on Theoretical Computer Science, Springer, ISBN: 0387563784, 1993

Equational Axioms for Regular Sets.
Mathematical Structures in Computer Science, 1993

Matrix and Matricial Iteration Theories, Part II.
J. Comput. Syst. Sci., 1993

Matrix and Matricial Iteration Theories, Part I.
J. Comput. Syst. Sci., 1993

Erratum: Iteration Algebras.
Int. J. Found. Comput. Sci., 1993

Some Quasi-Varieties of Iteration Theories.
Proceedings of the Mathematical Foundations of Programming Semantics, 1993

1992
Iteration Algebras.
Int. J. Found. Comput. Sci., 1992

1991
Results on Homomorphic Realization of Automata by alpha_0-Products.
Theor. Comput. Sci., 1991

Floyd-Hoare Logic in Iteration Theories.
J. ACM, 1991

Cayley iff Stone.
Bulletin of the EATCS, 1991

A note on isomorphic simulation of automata by networks of two-state automata.
Discrete Applied Mathematics, 1991

Iteration Algebras (Extended Abstract).
Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

Program Correctness and Matricial Iteration Theories.
Proceedings of the Mathematical Foundations of Programming Semantics, 1991

1990
A note on the axiomatization of iteration theories.
Acta Cybern., 1990

Product hierarchies of automata and homomorphic simulation.
Acta Cybern., 1990

1989
Equational Logic of Circular Data Type Specification.
Theor. Comput. Sci., 1989

On Product Hierarchies of Automata.
Proceedings of the Fundamentals of Computation Theory, 1989

1988
Critical Classes for the alpha_0-Product.
Theor. Comput. Sci., 1988

Varieties of Iteration Theories.
SIAM J. Comput., 1988

Independence of the Equational Axioms for Iteration Theories.
J. Comput. Syst. Sci., 1988

On homomorphic simulation of automata by α0-products.
Acta Cybern., 1988

On the hierarchy of νi-product.
Acta Cybern., 1988

An Extension of the Krohn-Rhodes Decomposition of Automata.
Proceedings of the Machines, 1988

1987
On a Representation of Tree Automata.
Theor. Comput. Sci., 1987

A note on α0* - products of aperiodic automata.
Acta Cybern., 1987

On isomorphic realization of automata with α0-products.
Acta Cybern., 1987

Loop products and loop-free products.
Acta Cybern., 1987

1986
On alpha-0-Products and alpha-2-Products.
Theor. Comput. Sci., 1986

Complete Classes of Automata for the alpha-0-Product.
Theor. Comput. Sci., 1986

On products of automata with identity.
Acta Cybern., 1986

Varieties and general products of top-down algebras.
Acta Cybern., 1986

Homomorphic Realizations of Automata with Compositions.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985
Axiomatizing Schemes and Their Behaviors.
J. Comput. Syst. Sci., 1985

On the weak equivalence of Elgot's flow-chart schemata.
Acta Cybern., 1985

1984
Some varieties of iteration theories.
Bulletin of the EATCS, 1984

1983
Algebras of Iteration Theories.
J. Comput. Syst. Sci., 1983

General products and equational classes of automata.
Acta Cybern., 1983

Decidability results concerning tree transducers II.
Acta Cybern., 1983

1981
Subdirectly irreducible commutative automata.
Acta Cybern., 1981

Remarks on finite commutative automata.
Acta Cybern., 1981

An Axiomatization of Regular Forests in the Language of Algebraic Theories with Iteration.
Proceedings of the Fundamentals of Computation Theory, 1981

1980
Decidability results concerning tree transducers I.
Acta Cybern., 1980

1979
On functional tree transducers.
FCT, 1979

1976
On two problems of A. Salomaa.
Acta Cybern., 1976


  Loading...