### Abstract

We investigate the state complexity of basic operations for suffix-free regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worst-case for the minimal deterministic finite-state automaton that accepts the language obtained from the operation. We establish the precise state complexity of catenation, Kleene star, reversal and the Boolean operations for suffix-free regular languages.

Original language | English |
---|---|

Title of host publication | Mathematical Foundations of Computer Science 2007 - 32nd International Symposium, MFCS 2007, Proceedings |

Pages | 501-512 |

Number of pages | 12 |

Publication status | Published - 2007 Dec 1 |

Event | 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007 - Cesky Krumlov, Czech Republic Duration: 2007 Aug 26 → 2007 Aug 31 |

### Publication series

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

Volume | 4708 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007 |
---|---|

Country | Czech Republic |

City | Cesky Krumlov |

Period | 07/8/26 → 07/8/31 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Computer Science(all)
- Biochemistry, Genetics and Molecular Biology(all)
- Theoretical Computer Science

### Cite this

*Mathematical Foundations of Computer Science 2007 - 32nd International Symposium, MFCS 2007, Proceedings*(pp. 501-512). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4708 LNCS).

}

*Mathematical Foundations of Computer Science 2007 - 32nd International Symposium, MFCS 2007, Proceedings.*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4708 LNCS, pp. 501-512, 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007, Cesky Krumlov, Czech Republic, 07/8/26.

**State complexity of basic operations on suffix-free regular languages.** / Han, Yo-Sub; Salomaa, Kai.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - State complexity of basic operations on suffix-free regular languages

AU - Han, Yo-Sub

AU - Salomaa, Kai

PY - 2007/12/1

Y1 - 2007/12/1

N2 - We investigate the state complexity of basic operations for suffix-free regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worst-case for the minimal deterministic finite-state automaton that accepts the language obtained from the operation. We establish the precise state complexity of catenation, Kleene star, reversal and the Boolean operations for suffix-free regular languages.

AB - We investigate the state complexity of basic operations for suffix-free regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worst-case for the minimal deterministic finite-state automaton that accepts the language obtained from the operation. We establish the precise state complexity of catenation, Kleene star, reversal and the Boolean operations for suffix-free regular languages.

UR - http://www.scopus.com/inward/record.url?scp=38049089885&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38049089885&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:38049089885

SN - 9783540744559

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

SP - 501

EP - 512

BT - Mathematical Foundations of Computer Science 2007 - 32nd International Symposium, MFCS 2007, Proceedings

ER -