Formal languages and enumeration

Algebraic Languages and Polyominoes Enumeration

In this paper, the u.)e of algebraic ianguages theory in solving an open problem in combinatorics is shown. By constructing a bijection between convex polyominoes and words of an algebraic language, atjd bq solving the corresponding algebraic qstem, we proie that the number of convex polyominoes with perimeter 2n + 8 is (2n + I1 )4” -4(2n + 1 )t2,F).

Efficient Enumeration of Regular Languages

The cross-section enumeration problem is to list all words of length n in a regular language L in lexicographical order. The enumeration problem is to list the first m words in L according to radix order. We present an algorithm for the cross-section enumeration problem that is linear in n. We provide a detailed analysis of the asymptotic running time of our algorithm and that of known algorith...

Automata and formal languages

Analogy and Formal Languages

Formal Languages