Distance desert automata and the star height problem
RAIRO-Theor. Inf. Appl., 39 3 (2005) 455-509
Published online: 2005-07-15
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):
Rigorous Assessment of Model Inference Accuracy using Language Cardinality
Donato Clun, Donghwan Shin, Antonio Filieri and Domenico BianculliACM Transactions on Software Engineering and Methodology 33 (4) 1 (2024)
https://doi.org/10.1145/3640332
Generic Results for Concatenation Hierarchies
Thomas Place and Marc ZeitounTheory of Computing Systems 63 (4) 849 (2019)
https://doi.org/10.1007/s00224-018-9867-0
10304 25 (2017)
https://doi.org/10.1007/978-3-319-58747-9_5
1 (2017)
https://doi.org/10.1109/LICS.2017.8005061
10329 101 (2017)
https://doi.org/10.1007/978-3-319-60134-2_9
Closure properties and complexity of rational sets of regular languages
Andreas Holzer, Christian Schallhart, Michael Tautschnig and Helmut VeithTheoretical Computer Science 605 62 (2015)
https://doi.org/10.1016/j.tcs.2015.08.035
From Finite Automata to Regular Expressions and Back—A Summary on Descriptional Complexity
Hermann Gruber and Markus HolzerElectronic Proceedings in Theoretical Computer Science 151 25 (2014)
https://doi.org/10.4204/EPTCS.151.2
Automata column
Mikołaj BojańczykACM SIGLOG News 1 (2) 3 (2014)
https://doi.org/10.1145/2677161.2677163
Foundations of Software Science and Computation Structures
Martin LangLecture Notes in Computer Science, Foundations of Software Science and Computation Structures 8412 195 (2014)
https://doi.org/10.1007/978-3-642-54830-7_13
123 (2013)
https://doi.org/10.1109/LICS.2013.17
Automata, Languages, and Programming
Szymon ToruńczykLecture Notes in Computer Science, Automata, Languages, and Programming 7392 377 (2012)
https://doi.org/10.1007/978-3-642-31585-5_35
Automata, Languages, and Programming
Denis Kuperberg and Michael Vanden BoomLecture Notes in Computer Science, Automata, Languages, and Programming 7392 287 (2012)
https://doi.org/10.1007/978-3-642-31585-5_28
Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring
Daniel KirstenTheoretical Computer Science 420 56 (2012)
https://doi.org/10.1016/j.tcs.2011.11.006
295 (2012)
https://doi.org/10.1109/LICS.2012.40
Mathematical Foundations of Computer Science 2011
Michael Vanden BoomLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2011 6907 580 (2011)
https://doi.org/10.1007/978-3-642-22993-0_52
Weak MSO with the Unbounding Quantifier
Mikołaj BojańczykTheory of Computing Systems 48 (3) 554 (2011)
https://doi.org/10.1007/s00224-010-9279-2
70 (2010)
https://doi.org/10.1109/LICS.2010.36
Sampled Semantics of Timed Automata
Pavel Krcal, Parosh Aziz Abdulla and Wang YiLogical Methods in Computer Science Volume 6, Issue 3 (2010)
https://doi.org/10.2168/LMCS-6(3:14)2010
Automata, Languages and Programming
Thomas Colcombet, Denis Kuperberg and Sylvain LombardyLecture Notes in Computer Science, Automata, Languages and Programming 6199 563 (2010)
https://doi.org/10.1007/978-3-642-14162-1_47
Universality of R-automata with Value Copying
Parosh Aziz Abdulla, Pavel Krcal and Wang YiElectronic Notes in Theoretical Computer Science 239 131 (2009)
https://doi.org/10.1016/j.entcs.2009.05.035
Bounded regular path queries in view-based data integration
Gösta Grahne and Alex ThomoInformation Processing Letters 109 (13) 739 (2009)
https://doi.org/10.1016/j.ipl.2009.03.011
Developments in Language Theory
Mikołaj BojańczykLecture Notes in Computer Science, Developments in Language Theory 5583 1 (2009)
https://doi.org/10.1007/978-3-642-02737-6_1
CONCUR 2008 - Concurrency Theory
Parosh Aziz Abdulla, Pavel Krcal and Wang YiLecture Notes in Computer Science, CONCUR 2008 - Concurrency Theory 5201 67 (2008)
https://doi.org/10.1007/978-3-540-85361-9_9
Automata, Languages and Programming
Hermann Gruber and Markus HolzerLecture Notes in Computer Science, Automata, Languages and Programming 5126 39 (2008)
https://doi.org/10.1007/978-3-540-70583-3_4
A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
Daniel KirstenRAIRO - Theoretical Informatics and Applications 42 (3) 553 (2008)
https://doi.org/10.1051/ita:2008017
Automata, Languages and Programming
Thomas Colcombet and Christof LödingLecture Notes in Computer Science, Automata, Languages and Programming 5126 398 (2008)
https://doi.org/10.1007/978-3-540-70583-3_33