On the existence of regular approximations-Reference-Cited by-同舟云学术

On the existence of regular approximations

Published:2007-11 Issue:2 Volume:387 Page:125-135
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Cordy Brendan,Salomaa Kai

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference15 articles.

1. Additive distances and quasi-distances between words;Calude;J. Universal Comput. Sci.,2002

2. C. Câmpeanu, A. Paˇun, Tight bounds for the state complexity of deterministic cover automata, in: H. Leung, G. Pighizzini (Eds.), Descriptional Complexity of Formal Systems, DCFS 2006, 21–23 June, Las Cruces, NM, 2006, pp. 223–231

3. Minimal cover automata for finite languages;Câmpeanu;Theoret. Comput. Sci.,2001

4. B. Cordy, K. Salomaa, Regular approximations of non-regular languages, in: H. Leung, G. Pighizzini (Eds.), Descriptional Complexity of Formal Systems, DCFS 2006, 21–23 June, Las Cruces, NM, 2006, pp. 118–129

5. Efficient computation of the relative entropy of probabilistic automata;Cortes,2006

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

1. Abstraction Based Supervisory Control for Non-Regular -Languages∗;IFAC-PapersOnLine;2022

2. Asymptotic Approximation by Regular Languages;SOFSEM 2021: Theory and Practice of Computer Science;2021

3. On counting functions and slenderness of languages;Theoretical Computer Science;2019-07

4. On Counting Functions of Languages;Developments in Language Theory;2018

5. Additive Number Theory via Approximation by Regular Languages;Developments in Language Theory;2018