Остановите войну!
for scientists:
default search action
Zoltán Ésik
- > Home > Persons > Zoltán Ésik
Publications
- 2021
- [p2]Zoltán Ésik:
Equational theories for automata. Handbook of Automata Theory (I.) 2021: 729-764 - 2019
- [j133]Zoltán Ésik:
Equational properties of fixed-point operations in cartesian categories: An overview. Math. Struct. Comput. Sci. 29(6): 909-925 (2019) - 2017
- [j126]Zoltán Ésik:
Equational axioms associated with finite automata for fixed point operations in cartesian categories. Math. Struct. Comput. Sci. 27(1): 54-69 (2017) - 2016
- [c70]Zoltán Ésik:
Ternary Equational Languages. CIAA 2016: 77-88 - 2015
- [j124]Zoltán Ésik:
Preface. Int. J. Found. Comput. Sci. 26(8): 1007-1008 (2015) - [j123]Zoltán Ésik:
Residuated Park theories. J. Log. Comput. 25(2): 453-471 (2015) - [c68]Zoltán Ésik:
Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview. MFCS (1) 2015: 18-37 - [c67]Zoltán Ésik:
A Representation Theorem for Stratified Complete Lattices. TbiLLC 2015: 263-289 - [c66]Zoltán Ésik:
Equational Properties of Stratified Least Fixed Points (Extended Abstract). WoLLIC 2015: 174-188 - [i28]Zoltán Ésik:
Equational Axioms for Fixed Point Operations. CoRR abs/1501.02190 (2015) - [i27]Zoltán Ésik:
A representation theorem for stratified complete lattices. CoRR abs/1503.05124 (2015) - 2014
- [j117]Zoltán Ésik:
Axiomatizing weighted synchronization trees and weighted bisimilarity. Theor. Comput. Sci. 534: 2-23 (2014) - [i23]Zoltán Ésik:
Equational properties of saturated least fixed points. CoRR abs/1410.8111 (2014) - 2013
- [c60]Zoltán Ésik:
A Connection Between Concurrency and Language Theory. MFPS 2013: 143-164 - [i22]Zoltán Ésik:
A connection between concurrency and language theory. CoRR abs/1303.0044 (2013) - 2012
- [j112]Zoltán Ésik:
Ordinal Automata and Cantor Normal Form. Int. J. Found. Comput. Sci. 23(1): 87-98 (2012) - 2011
- [j106]Zoltán Ésik:
An undecidable property of context-free linear orders. Inf. Process. Lett. 111(3): 107-109 (2011) - [c55]Zoltán Ésik:
Partial Conway and Iteration Semiring-Semimodule Pairs. Algebraic Foundations in Computer Science 2011: 56-71 - [c52]Zoltán Ésik:
Scattered Context-Free Linear Orderings. Developments in Language Theory 2011: 216-227 - [c51]Zoltán Ésik:
Multi-Linear Iterative K-Σ-Semialgebras. MFPS 2011: 159-170 - [i17]Zoltán Ésik:
Scattered context-free linear orderings. CoRR abs/1102.0850 (2011) - [i16]Zoltán Ésik:
Residuated Park Theories. CoRR abs/1102.1139 (2011) - [i15]Zoltán Ésik:
Multi-linear iterative K-Sigma-semialgebras. CoRR abs/1102.3106 (2011) - 2010
- [j100]Zoltán Ésik:
Axiomatizing the equational theory of regular tree languages. J. Log. Algebraic Methods Program. 79(2): 189-213 (2010) - [c47]Zoltán Ésik:
Representing Small Ordinals by Finite Automata. DCFS 2010: 78-87 - [i11]Zoltán Ésik:
An undecidable property of context-free languages. CoRR abs/1004.1736 (2010) - 2008
- [c41]Zoltán Ésik:
Iteration Semirings. Developments in Language Theory 2008: 1-20 - 2006
- [j89]Zoltán Ésik:
Preface. Acta Cybern. 17(4): 663 (2006) - [j87]Zoltán Ésik:
Characterizing CTL-like logics on finite trees. Theor. Comput. Sci. 356(1-2): 136-152 (2006) - [j86]Zoltán Ésik:
Preface. Theor. Comput. Sci. 366(3): 181 (2006) - [e6]Zoltán Ésik:
Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings. Lecture Notes in Computer Science 4207, Springer 2006, ISBN 3-540-45458-6 [contents] - 2005
- [c35]Zoltán Ésik:
Cascade Products and Temporal Logics on Finite Trees. APC 25 2005: 163-166 - 2002
- [j62]Zoltán Ésik:
Continuous Additive Algebras and Injective Simulations of Synchronization Trees. J. Log. Comput. 12(2): 271-300 (2002) - [j61]Zoltán Ésik:
Axiomatizing the subsumption and subword preorders on finite and infinite partial words. Theor. Comput. Sci. 273(1-2): 225-248 (2002) - [c28]Zoltán Ésik:
Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators. Developments in Language Theory 2002: 43-58 - 2001
- [c25]Zoltán Ésik:
The Equational Theory of Fixed Points with Applications to Generalized Language Theory. Developments in Language Theory 2001: 21-36 - 2000
- [j57]Zoltán Ésik:
The Power of the Group-Identities for Iteration. Int. J. Algebra Comput. 10(3): 349-374 (2000) - [j54]Zoltán Ésik:
A proof of the Krohn-Rhodes Decomposition Theorem. Theor. Comput. Sci. 234(1-2): 287-300 (2000) - [c21]Zoltán Ésik:
Axiomatizing the Least Fixed Point Operation and Binary Supremum. CSL 2000: 302-316 - [c19]Zoltán Ésik:
Iteration Theories of Boolean Functions. MFCS 2000: 343-352 - 1999
- [j53]Zoltán Ésik:
Axiomatizing Iteration Categories. Acta Cybern. 14(1): 65-82 (1999) - [j52]Zoltán Ésik:
Group Axioms for Iteration. Inf. Comput. 148(2): 131-180 (1999) - 1998
- [j49]Zoltán Ésik:
A Cayley Theorem for Ternary Algebras. Int. J. Algebra Comput. 8(3): 311-316 (1998) - [c16]Zoltán Ésik:
Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract). STACS 1998: 455-465 - 1997
- [j43]Zoltán Ésik:
Completeness of Park Induction. Theor. Comput. Sci. 177(1): 217-283 (1997) - 1993
- [e1]Zoltán Ésik:
Fundamentals of Computation Theory, 9th International Symposium, FCT '93, Szeged, Hungary, August 23-27, 1993, Proceedings. Lecture Notes in Computer Science 710, Springer 1993, ISBN 3-540-57163-9 [contents] - 1991
- [j30]Zoltán Ésik:
A note on isomorphic simulation of automata by networks of two-state automata. Discret. Appl. Math. 30(1): 77-82 (1991) - [j27]Zoltán Ésik:
Results on Homomorphic Realization of Automata by alpha_0-Products. Theor. Comput. Sci. 87(2): 229-249 (1991) - 1990
- [j25]Zoltán Ésik:
A note on the axiomatization of iteration theories. Acta Cybern. 9(4): 375-384 (1990) - 1988
- [j21]Zoltán Ésik:
Independence of the Equational Axioms for Iteration Theories. J. Comput. Syst. Sci. 36(1): 66-76 (1988) - [c4]Zoltán Ésik:
An Extension of the Krohn-Rhodes Decomposition of Automata. IMYCS 1988: 66-71 - 1987
- [j17]Zoltán Ésik:
Loop products and loop-free products. Acta Cybern. 8(1): 45-48 (1987) - [j16]Zoltán Ésik:
On isomorphic realization of automata with α0-products. Acta Cybern. 8(2): 119-127 (1987) - 1986
- [j14]Zoltán Ésik:
Varieties and general products of top-down algebras. Acta Cybern. 7(3): 293-298 (1986) - 1985
- [j10]Zoltán Ésik:
On the weak equivalence of Elgot's flow-chart schemata. Acta Cybern. 7(2): 147-154 (1985) - 1983
- [j6]Zoltán Ésik:
Decidability results concerning tree transducers II. Acta Cybern. 6(3): 303-314 (1983) - [j5]Zoltán Ésik:
Algebras of Iteration Theories. J. Comput. Syst. Sci. 27(2): 291-303 (1983) - 1981
- [c2]Zoltán Ésik:
An Axiomatization of Regular Forests in the Language of Algebraic Theories with Iteration. FCT 1981: 130-136 - 1980
- [j2]Zoltán Ésik:
Decidability results concerning tree transducers I. Acta Cybern. 5(1): 1-20 (1980) - 1979
- [c1]Zoltán Ésik:
On functional tree transducers. FCT 1979: 121-127 - 1976
- [j1]Zoltán Ésik:
On two problems of A. Salomaa. Acta Cybern. 2(4): 299-306 (1976)
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-04-25 02:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint