Asymptotic Approximation by Regular Languages-Reference-Cited by-同舟云学术

Asymptotic Approximation by Regular Languages

Published:2021 Issue: Volume: Page:74-88
ISSN:0302-9743
Container-title:SOFSEM 2021: Theory and Practice of Computer Science
language:
Short-container-title:

Author:

Sin’ya Ryoma

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-67731-2_6

Reference22 articles.

1. Autebert, J.M., Flajolet, P., Gabarro, J.: Prefixes of infinite words and ambiguous context-free languages. Inf. Process. Lett. 25(4), 211–216 (1987)

2. Berstel, J.: Sur la densité asymptotique de langages formels. In: International Colloquium on Automata. Languages and Programming, pp. 345–358. North-Holland, France (1973)

3. Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (2009)

4. Buck, R.C.: The measure theoretic approach to density. Am. J. Math. 68(4), 560–580 (1946)

5. Câmpeanu, C., Sântean, N., Yu, S.: Minimal cover-automata for finite languages. Theoret. Comput. Sci. 267(1), 3–16 (2001)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Measuring Power of Commutative Group Languages;Lecture Notes in Computer Science;2024

2. Measuring Power of Generalised Definite Languages;Implementation and Application of Automata;2023

3. Dense Languages and Non Primitive Words;Acta Cybernetica;2022-03-01

4. On primitive words with non-primitive product;RAIRO - Theoretical Informatics and Applications;2022

5. Measuring Power of Locally Testable Languages;Developments in Language Theory;2022