On frontiers of regular trees
RAIRO-Theor. Inf. Appl., 20 4 (1986) 371-381
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
On the Order Type of Scattered Context-Free Orderings
Kitti Gelle and Szabolcs IvánElectronic Proceedings in Theoretical Computer Science 305 169 (2019)
https://doi.org/10.4204/EPTCS.305.12
The ordinal generated by an ordinal grammar is computable
Kitti Gelle and Szabolcs IvánTheoretical Computer Science 793 1 (2019)
https://doi.org/10.1016/j.tcs.2019.04.016
Two equational theories of partial words
Ch. Choffrut and Z. ÉsikTheoretical Computer Science 737 19 (2018)
https://doi.org/10.1016/j.tcs.2018.04.010
Isomorphism of regular trees and words
Markus Lohrey and Christian MathissenInformation and Computation 224 71 (2013)
https://doi.org/10.1016/j.ic.2013.01.002
ON CONTEXT-FREE LANGUAGES OF SCATTERED WORDS
ZOLTÁN ÉSIK and SATOSHI OKAWAInternational Journal of Foundations of Computer Science 24 (07) 1029 (2013)
https://doi.org/10.1142/S0129054113400297
Mathematical Foundations of Computer Science 2013
Dietrich KuskeLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2013 8087 619 (2013)
https://doi.org/10.1007/978-3-642-40313-2_55
Logic and Its Applications
Tim French, John McCabe-Dansted and Mark ReynoldsLecture Notes in Computer Science, Logic and Its Applications 7750 50 (2013)
https://doi.org/10.1007/978-3-642-36039-8_6
ORDINAL AUTOMATA AND CANTOR NORMAL FORM
ZOLTÁN ÉSIKInternational Journal of Foundations of Computer Science 23 (01) 87 (2012)
https://doi.org/10.1142/S0129054112400060
Theoretical Computer Science
Arnaud Carayol and Zoltán ÉsikLecture Notes in Computer Science, Theoretical Computer Science 7604 104 (2012)
https://doi.org/10.1007/978-3-642-33475-7_8
Developments in Language Theory
Zoltan Ésik and Satoshi OkawaLecture Notes in Computer Science, Developments in Language Theory 7410 142 (2012)
https://doi.org/10.1007/978-3-642-31653-1_14
LATIN 2012: Theoretical Informatics
Zoltán Ésik and Szabolcs IvánLecture Notes in Computer Science, LATIN 2012: Theoretical Informatics 7256 291 (2012)
https://doi.org/10.1007/978-3-642-29344-3_25
Büchi context-free languages
Zoltán Ésik and Szabolcs IvánTheoretical Computer Science 412 (8-10) 805 (2011)
https://doi.org/10.1016/j.tcs.2010.11.026
An undecidable property of context-free linear orders
Z. ÉsikInformation Processing Letters 111 (3) 107 (2011)
https://doi.org/10.1016/j.ipl.2010.10.018
Theoretical Aspects of Computing - ICTAC 2009
Zoltán Ésik and Szabolcs IvánLecture Notes in Computer Science, Theoretical Aspects of Computing - ICTAC 2009 5684 185 (2009)
https://doi.org/10.1007/978-3-642-03466-4_12
Tree Automata and Automata on Linear Orderings
Véronique Bruyère, Olivier Carton and Géraud SénizerguesRAIRO - Theoretical Informatics and Applications 43 (2) 321 (2009)
https://doi.org/10.1051/ita/2009009
Algebra and Coalgebra in Computer Science
S. L. Bloom and Z. ÉsikLecture Notes in Computer Science, Algebra and Coalgebra in Computer Science 4624 1 (2007)
https://doi.org/10.1007/978-3-540-73859-6_1
Automata on linear orderings
Véronique Bruyère and Olivier CartonJournal of Computer and System Sciences 73 (1) 1 (2007)
https://doi.org/10.1016/j.jcss.2006.10.009
A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS
ALEXIS BÈS and OLIVIER CARTONInternational Journal of Foundations of Computer Science 17 (03) 519 (2006)
https://doi.org/10.1142/S0129054106003978
Developments in Language Theory
Alexis Bès and Olivier CartonLecture Notes in Computer Science, Developments in Language Theory 3572 158 (2005)
https://doi.org/10.1007/11505877_14
The equational theory of regular words
Stephen L. Bloom and Zoltán ÉsikInformation and Computation 197 (1-2) 55 (2005)
https://doi.org/10.1016/j.ic.2005.01.004
Infinite Words - Automata, Semigroups, Logic and Games
Pure and Applied Mathematics, Infinite Words - Automata, Semigroups, Logic and Games 141 499 (2004)https://doi.org/10.1016/S0079-8169(04)80014-X
Axiomatizing omega and omega-op powers of words
Stephen L. Bloom and Zoltán ÉsikRAIRO - Theoretical Informatics and Applications 38 (1) 3 (2004)
https://doi.org/10.1051/ita:2004005
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Stephen L. Bloom and Zoltán ÉsikLecture Notes in Computer Science, FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science 2914 50 (2003)
https://doi.org/10.1007/978-3-540-24597-1_5
Developments in Language Theory
Véronique Bruyère and Olivier CartonLecture Notes in Computer Science, Developments in Language Theory 2450 103 (2003)
https://doi.org/10.1007/3-540-45005-X_9
Mathematical Foundations of Computer Science 2001
Véronique Bruyère and Olivier CartonLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2001 2136 236 (2001)
https://doi.org/10.1007/3-540-44683-4_21
Infinite hypergraphs I. Basic properties
Michael BauderonTheoretical Computer Science 82 (2) 177 (1991)
https://doi.org/10.1016/0304-3975(91)90222-N
Formal Models and Semantics
Wolfgang THOMASFormal Models and Semantics 133 (1990)
https://doi.org/10.1016/B978-0-444-88074-1.50009-3