Efficient enumeration of regular languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4783 LNCS, Issue , 2007, Pages 226-242

  Ackerman, Margareta ^a   Shallit, Jeffrey ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Enumeration; Lexicographical order; Nondeterministic finite automaton; Radix order; Regular language

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; FINITE AUTOMATA; PROBLEM SOLVING; WORD PROCESSING;

ENUMERATION; LEXICOGRAPHICAL ORDER; NONDETERMINISTIC FINITE AUTOMATON; RADIX ORDER;

FORMAL LANGUAGES;

EID: 38149128299     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76336-9_22     Document Type: Conference Paper

References (6)

1. Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, London (1971)
2. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9, 251-280 (1990)
3. Department of Computer Science, University of Western Ontario, Canada, http://www.csd.uwo.ca/Research/grail/index.html
4. Mäkinen, E.: On lexicographic enumeration of regular and context-free languages. Acta Cybern. 13, 55-61 (1997)
5. Nijenhuis, A., Wilf, H.S.: Combinatorial Algorithms: For Computers and Calculators. Academic Press, Inc, NY, USA (1978)
6. Strassen, V.: Gaussian elimination is not optimal. Journal Numerische Mathematik 13, 354-356 (1969)