A graph theoretic approach to automata minimality

Risultato della ricerca: Article

4 Citazioni (Scopus)

Abstract

The paper presents a graph-theoretic approach to test the minimality of a deterministic automaton. In particular, we focus on problems concerning the dependence of the minimality of an automaton on the choice of the set F of final states or on the cardinality of the set F . We introduce different minimality conditions of an automaton and show that such conditions can be characterized in graph-theoretic terms.
Lingua originaleEnglish
pagine (da-a)282-291
Numero di pagine10
RivistaTheoretical Computer Science
Volume429
Stato di pubblicazionePublished - 2012

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Entra nei temi di ricerca di 'A graph theoretic approach to automata minimality'. Insieme formano una fingerprint unica.

  • Cita questo