Zoltán Ésik - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Dagger extension theoremZoltán Ésik, T. Hajgató. mscs, 21(5):1035-1066, 2011. [doi]

Büchi context-free languagesZoltán Ésik, Szabolcs Iván. TCS, 412(8-10):805-821, 2011. [doi]

An undecidable property of context-free linear ordersZoltán Ésik. ipl, 111(3):107-109, 2011. [doi]

2010

Algebraic OrdinalsStephen L. Bloom, Zoltán Ésik. FUIN, 99(4):383-407, 2010. [doi]

PrefaceErzsébet Csuhaj-Varjú, Zoltán Ésik. ijfcs, 21(5):687-688, 2010. [doi]

Simulation vs. EquivalenceZoltán Ésik, Andreas Maletti. fcs 2010: 119-124

Axiomatizing the equational theory of regular tree languagesZoltán Ésik. jlp, 79(2):189-213, 2010. [doi]

Simulations of Weighted Tree AutomataZoltán Ésik, Andreas Maletti. wia 2011: 321-330 [doi]

Algebraic Characterization of Logically Defined Tree LanguagesZoltán Ésik, Pascal Weil. ijac, 20(2):195-239, 2010. [doi]

On Müller Context-Free GrammarsZoltán Ésik, Szabolcs Iván. dlt 2010: 173-184 [doi]

2009

Automata, Formal Languages, and Related Topics - Dedicated to Ferenc Gécseg on the occasion of his 70th birthdayZoltán Ésik, Zoltán Fülöp, editors, Institute of Informatics, University of Szeged, Hungary, 2009.

2008

Partial Conway and Iteration SemiringsStephen L. Bloom, Zoltán Ésik, Werner Kuich. FUIN, 86(1-2):19-40, 2008. [doi]

Iteration SemiringsZoltán Ésik. dlt 2008: 1-20 [doi]

Some Varieties of Finite Tree Automata Related to Restricted Temporal LogicsZoltán Ésik, Szabolcs Iván. FUIN, 82(1-2):79-103, 2008. [doi]

Products of Tree Automata with an Application to Temporal LogicZoltán Ésik, Szabolcs Iván. FUIN, 82(1-2):61-78, 2008. [doi]

Games for Temporal Logics on TreesZoltán Ésik, Szabolcs Iván. wia 2008: 191-200 [doi]

2007

Regular and Algebraic Words and OrdinalsStephen L. Bloom, Zoltán Ésik. calco 2007: 1-15 [doi]

Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, ProceedingsErzsébet Csuhaj-Varjú, Zoltán Ésik, editors, Volume 4639 of Lecture Notes in Computer Science, Springer, 2007.

Fuzzy tree automataZoltán Ésik, Guangwu Liu. fss, 158(13):1450-1460, 2007. [doi]

Boolean Fuzzy SetsZoltán Ésik, Werner Kuich. ijfcs, 18(6):1197-1207, 2007. [doi]

A Semiring-Semimodule Generalization of Transducers and Abstract omega-Families of Power SeriesZoltán Ésik, Werner Kuich. jalc, 12(4):435-454, 2007.

Aperiodicity in Tree AutomataZoltán Ésik, Szabolcs Iván. cai 2007: 189-207 [doi]

An Algebraic Characterization of Wolper s LogicZoltán Ésik, Gabriela Martín. fcs 2007: 139-143

2006

PrefaceAlberto Bertoni, Zoltán Ésik, Juhani Karhumäki. TCS, 356(1-2):1-5, 2006. [doi]

Completing Categorical AlgebrasStephen L. Bloom, Zoltán Ésik. ifipTCS 2006: 231-249 [doi]

Recent Advances in Formal Languages and ApplicationsZoltán Ésik, Carlos Martín-Vide, Victor Mitrana, editors, Volume 25 of Studies in Computational Intelligence, Springer, 2006.

PrefaceZoltán Ésik. TCS, 366(3):181, 2006. [doi]

Characterizing CTL-like logics on finite treesZoltán Ésik. TCS, 356(1-2):136-152, 2006. [doi]

Cascade Products and Temporal Logics on Finite TreesZoltán Ésik. ENTCS, 162:163-166, 2006. [doi]

Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, ProceedingsZoltán Ésik, editor, Volume 4207 of Lecture Notes in Computer Science, Springer, 2006.

2005

Guest editors foreword: Process AlgebraLuca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Zoltán Ésik. TCS, 335(2-3):127-129, 2005. [doi]

The equational theory of regular wordsStephen L. Bloom, Zoltán Ésik. iandc, 197(1-2):55-89, 2005. [doi]

A Semiring-Semimodule Generalization of ?-Regular Languages IZoltán Ésik, Werner Kuich. jalc, 10(2/3):203-242, 2005.

A Semiring-Semimodule Generalization of ?-Regular Languages IIZoltán Ésik, Werner Kuich. jalc, 10(2/3):243-264, 2005.

Algebraic recognizability of regular tree languagesZoltán Ésik, Pascal Weil. TCS, 340(1):291-321, 2005. [doi]

Algebraically complete semirings and Greibach normal formZoltán Ésik, Hans Leiß. APAL, 133(1-3):173-203, 2005. [doi]

2004

ForewordZoltán Ésik, Zoltán Fülöp. TCS, 327(3):223-224, 2004. [doi]

Inductive star-semiringsZoltán Ésik, Werner Kuich. TCS, 324(1):3-33, 2004. [doi]

Higher Dimensional AutomataZoltán Ésik, Zoltán L. Németh. jalc, 9(1):3-29, 2004.

An Algebraic Generalization of omega-Regular LanguagesZoltán Ésik, Werner Kuich. mfcs 2004: 648-659 [doi]

A Semiring-Semimodule Generalization of omega-Context-Free LanguagesZoltán Ésik, Werner Kuich. BIRTHDAY 2004: 68-80 [doi]

2003

Equational theories of tropical semiringsLuca Aceto, Zoltán Ésik, Anna Ingólfsdóttir. TCS, 3(298):417-469, 2003. [doi]

Axioms for Regular Words: Extended AbstractStephen L. Bloom, Zoltán Ésik. fsttcs 2003: 50-61 [doi]

An Extension Theorem with an Application to Formal Tree SeriesStephen L. Bloom, Zoltán Ésik. jalc, 8(2):145-185, 2003.

Deciding whether the frontier of a regular tree is scatteredStephen L. Bloom, Zoltán Ésik. FUIN, 55(1):1-21, 2003. [doi]

Hazard AlgebrasJanusz A. Brzozowski, Zoltán Ésik. fmsd, 23(3):223-256, 2003. [doi]

Developments in Language Theory, 7th International Conference, DLT 2003, Szeged, Hungary, July 7-11, 2003, ProceedingsZoltán Ésik, Zoltán Fülöp, editors, Volume 2710 of Lecture Notes in Computer Science, Springer, 2003.

Regular languages definable by Lindström quantifiersZoltán Ésik, Kim Guldstrand Larsen. ita, 37(3):179-241, 2003. [doi]

ForewordZoltán Ésik, Anna Ingólfsdóttir. ita, 37(4):272, 2003.

Formal Tree SeriesZoltán Ésik, Werner Kuich. jalc, 8(2):219-285, 2003.

Temporal Logic with Cyclic Counting and the Degree of Aperiodicity of Finite AutomataZoltán Ésik, Masami Ito. actaC, 16(1):1-28, 2003. [doi]

On Logically Defined Recognizable Tree LanguagesZoltán Ésik, Pascal Weil. fsttcs 2003: 195-207 [doi]

2002

Equational Axioms for Probabilistic BisimilarityLuca Aceto, Zoltán Ésik, Anna Ingólfsdóttir. amast 2002: 239-253 [doi]

A Fully Equational Proof of Parikh s TheoremLuca Aceto, Zoltán Ésik, Anna Ingólfsdóttir. ita, 36(2):129-153, 2002. [doi]

Unique, guarded fixed points in an additive setting: Extended AbstractStephen L. Bloom, Zoltán Ésik. ENTCS, 69, 2002. [doi]

Rationally Additive SemiringsZoltán Ésik, Werner Kuich. jucs, 8(2):173-183, 2002. [doi]

Axiomatizing the subsumption and subword preorders on finite and infinite partial wordsZoltán Ésik. TCS, 273(1-2):225-248, 2002. [doi]

Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished GeneratorsZoltán Ésik. dlt 2003: 43-58 [doi]

Greibach Normal Form in Algebraically Complete SemiringsZoltán Ésik, Hans Leiß. csl 2002: 135-150 [doi]

Continuous Additive Algebras and Injective Simulations of Synchronization TreesZoltán Ésik. logcom, 12(2):271-300, 2002. [doi]

Fixed Points in Computer Science, FICS 2002, Copenhagen, Denmark, 20-21 July 2002, Preliminary ProceedingsZoltán Ésik, Anna Ingólfsdóttir, editors, Volume NS-02-2 of BRICS Notes Series, University of Aarhus, 2002.

2001

Axiomatizing Tropical SemiringsLuca Aceto, Zoltán Ésik, Anna Ingólfsdóttir. fossacs 2001: 42-56 [doi]

Iteration 2-theoriesStephen L. Bloom, Zoltán Ésik, Anna Labella, Ernest G. Manes. acs, 9(2):173-216, 2001. [doi]

Algebras for Hazard DetectionJanusz A. Brzozowski, Zoltán Ésik, Y. Iland. ismvl 2001: 3

On Equations for Union-Free Regular LanguagesSinisa Crvenkovic, Igor Dolinka, Zoltán Ésik. iandc, 164(1):152-172, 2001.

Homomorphic Simulation and Letichevsky s CriterionPál Dömösi, Zoltán Ésik. jalc, 6(4):427-436, 2001.

A Generation of Kozen s Axiomatization of the Equational Theory of the Regular SetsZoltán Ésik, Werner Kuich. BIRTHDAY 2001: 99-114

Automata on Series-Parallel BiposetsZoltán Ésik, Zoltán L. Németh. dlt 2002: 217-227 [doi]

The Equational Theory of Fixed Points with Applications to Generalized Language TheoryZoltán Ésik. dlt 2002: 21-36 [doi]

2000

On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural NumbersLuca Aceto, Zoltán Ésik, Anna Ingólfsdóttir. STACS 2000: 267-278 [doi]

Iteration Algebras Are Not Finitely Axiomatizable. Extended AbstractStephen L. Bloom, Zoltán Ésik. latin 2000: 367-376

Hazard Algebras (Extended Abstract)Janusz A. Brzozowski, Zoltán Ésik. hcat 2000: 1-19

The Variety of Kleene Algebras with Conversion is not Finitely BasedSinisa Crvenkovic, Igor Dolinka, Zoltán Ésik. TCS, 230(1-2):235-245, 2000. [doi]

A proof of the Krohn-Rhodes Decomposition TheoremZoltán Ésik. TCS, 234(1-2):287-300, 2000. [doi]

The Power of the Group-Identities for IterationZoltán Ésik. ijac, 10(3):349-374, 2000. [doi]

Axiomatizing the Least Fixed Point Operation and Binary SupremumZoltán Ésik. csl 2000: 302-316 [doi]

Iteration Theories of Boolean FunctionsZoltán Ésik. mfcs 2000: 343-352 [doi]

A Kleene Theorem for Lindenmayerian Algebraic Power SeriesZoltán Ésik, Werner Kuich. jalc, 5(2):109-122, 2000.

1999

A Note on Equations for Commutative Regular LanguagesSinisa Crvenkovic, Igor Dolinka, Zoltán Ésik. ipl, 70(6):265-267, 1999. [doi]

Axiomatizing Iteration CategoriesZoltán Ésik. actaC, 14(1):65-82, 1999. [doi]

Group Axioms for IterationZoltán Ésik. iandc, 148(2):131-180, 1999.

Series and Parallel Operations on PomsetsZoltán Ésik, Satoshi Okawa. fsttcs 1999: 316-328 [doi]

1998

Semantics on Flowchart Programs and the Free Conway TheoriesL. Bernátsky, Zoltán Ésik. ita, 32(1-3):35-78, 1998.

Nonfinite Axiomatizability of the Equational Theory of ShuffleZoltán Ésik, Michael Bertol. ACTA, 35(6):505-539, 1998. [doi]

Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract)Zoltán Ésik. STACS 1998: 455-465

Equational Properties of Iteration in Algebraically Complete CategoriesZoltán Ésik, Anna Labella. TCS, 195(1):61-89, 1998. [doi]

1997

Varieties Generated by Languages with Poset OperationsStephen L. Bloom, Zoltán Ésik. mscs, 7(6):701-713, 1997.

Axiomatizing Shuffle and Concatenation in LanguagesStephen L. Bloom, Zoltán Ésik. iandc, 139(1):62-91, 1997.

Iteration 2-Theories: Extended AbstractStephen L. Bloom, Anna Labella, Zoltán Ésik, Ernest G. Manes. amast 1997: 30-44

The Equational Logic of Fixed Points (Tutorial)Stephen L. Bloom, Zoltán Ésik. TCS, 179(1-2):1-60, 1997. [doi]

Completeness of Park InductionZoltán Ésik. TCS, 177(1):217-283, 1997. [doi]

1996

Fixed-Point Operations on ccc s. Part IStephen L. Bloom, Zoltán Ésik. TCS, 155(1):1-38, 1996. [doi]

Two Axiomatizations of a Star Semiring Quasi-VarietyStephen L. Bloom, Zoltán Ésik. eatcs, 59, 1996.

Free Shuffle Algebras in Language VarietiesStephen L. Bloom, Zoltán Ésik. TCS, 163(1&2):55-98, 1996. [doi]

Equational Properties of Iteration in Algebraically Complete CategoriesZoltán Ésik, Anna Labella. mfcs 1996: 336-347

1995

PreviousNext