Author:
Ésik Zoltán,Iván Szabolcs
Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. Lecture Notes in Computer Science;N. Bedon,2008
2. Lecture Notes in Computer Science;A. Bès,2005
3. Lecture Notes in Computer Science;L. Braud,2010
4. Bloom, S.L., Choffrut, C.: Long words: the theory of concatenation and omega-power. Theoretical Computer Science 259, 533–548 (2001)
5. Bloom, S.L., Ésik, Z.: Deciding whether the frontier of a regular tree is scattered. Fundamenta Informaticae 55, 1–21 (2003)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Order Type of Scattered Context-Free Orderings of Rank One Is Computable;SOFSEM 2020: Theory and Practice of Computer Science;2020
2. The ordinal generated by an ordinal grammar is computable;Theoretical Computer Science;2019-11
3. On the Order Type of Scattered Context-Free Orderings;Electronic Proceedings in Theoretical Computer Science;2019-09-18
4. OPERATIONAL CHARACTERIZATION OF SCATTERED MCFLs;International Journal of Foundations of Computer Science;2014-12
5. ON CONTEXT-FREE LANGUAGES OF SCATTERED WORDS;International Journal of Foundations of Computer Science;2013-11