Martyugin, Pavel:
*Complexity of problems concerning reset words for some partial cases of automata.*
Acta cybernetica, (19) 2.
pp. 517-536. (2009)

Cikk, tanulmány, mű
Martyugin_2009_ActaCybernetica.pdf Download (176kB) |

## Abstract

A word w is called a reset word for a deterministic finite automaton A if it maps all states of A to one state. A word w is called a compressing to M states for a deterministic finite automaton A if it maps all states of A to at most M states. We consider several subclasses of automata: aperiodic, D-trivial, monotonic, partially monotonic automata and automata with a zero state. For these subclasses we study the computational complexity of the following problems. Does there exist a reset word for a given automaton? Does there exist a reset word of given length for a given automaton? What is the length of the shortest reset word for a given automaton? Moreover, we consider complexity of the same problems for compressing words.

Item Type: | Article |
---|---|

Event Title: | International Conference on Automata and Formal Languages, 12., 2008, Szeged |

Journal or Publication Title: | Acta cybernetica |

Date: | 2009 |

Volume: | 19 |

Number: | 2 |

Page Range: | pp. 517-536 |

ISSN: | 0324-721X |

Language: | angol |

Uncontrolled Keywords: | Természettudomány, Informatika |

Additional Information: | Bibliogr.: p. 535-536.; Abstract |

Date Deposited: | 2016. Oct. 15. 12:25 |

Last Modified: | 2018. Jun. 06. 11:26 |

URI: | http://acta.bibl.u-szeged.hu/id/eprint/12877 |

### Actions (login required)

View Item |