Name
Abstract | ||
|---|---|---|
We consider five operators on a regular language. Each of them is a tool for constructing a code (respectively prefix, suffix, bifix, infix) and a hypercode out of a given regular language. We give the precise values of the (deterministic) state complexity of these operators: over a constant-size alphabet for the first four of them and over a quadratic-size alphabet for the hypercode operator. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1142/S0129054111008957 | INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE |
Keywords | Field | DocType |
State complexity, regular language, code | Discrete mathematics,Combinatorics,Suffix,State complexity,Prefix,Infix,Operator (computer programming),Regular language,Code (cryptography),Mathematics,Alphabet | Journal |
Volume | Issue | ISSN |
22 | 7 | 0129-0541 |
Citations | PageRank | References |
4 | 0.50 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elena V. Pribavkina | 1 | 52 | 9.22 |
| Emanuele Rodaro | 2 | 55 | 15.63 |