Enumeration and generation with a string automata representation-Reference-Cited by-同舟云学术

Enumeration and generation with a string automata representation

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

Author:

Almeida Marco,Moreira Nelma,Reis Rogério

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference24 articles.

1. M. Almeida, N. Moreira, R. Reis, Aspects of enumeration and generation with a string automata representation, in: H. Leung, G. Pighizzini (Eds.), Proc. of DCFS’06, NMSU-CS-2006-001, in: Comp. Sci. Tech. Report, NMSU, 2006, pp. 58–69

2. M. Almeida, R. Reis, Efficient representation of integer sets, Tech. Rep. DCC-2006-06, DCC-FC&LIACC, Univ. do Porto, 2006

3. Enumeration and random generation of accessible automata;Bassino;Theoret. Comput. Sci.,2007

4. Random generation of DFAs;Champarnaud;Theoret. Comput. Sci.,2005

5. Boltzmann samplers for the random generation of combinatorial structures;Duchon;Combin. Probab. Comput.,2004

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

1. Succinct representation for (non)deterministic finite automata;Journal of Computer and System Sciences;2023-02

2. Succinct Representation for (Non)Deterministic Finite Automata;SSRN Electronic Journal;2022

3. Hot Current Topics of Descriptional Complexity;IFIP Advances in Information and Communication Technology;2021

4. Succinct Representations for (Non)Deterministic Finite Automata;Language and Automata Theory and Applications;2021

5. Guest Column;ACM SIGACT News;2020-03-12