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

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

## 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 |
---|---|

Journal or Publication Title: | Acta cybernetica |

Date: | 2009 |

Volume: | 19 |

Number: | 2 |

ISSN: | 0324-721X |

Page Range: | pp. 517-536 |

Language: | English |

Place of Publication: | Szeged |

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

Related URLs: | http://acta.bibl.u-szeged.hu/38528/ |

Uncontrolled Keywords: | Számítástechnika, Kibernetika |

Additional Information: | Bibliogr.: p. 535-536. ; összefoglalás angol nyelven |

Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |

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

Last Modified: | 2022. Jun. 17. 09:55 |

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

## Actions (login required)

View Item |