A graph theoretic approach to automata minimality

Research output: Contribution to journalArticlepeer-review

4 Citations (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.
Original languageEnglish
Pages (from-to)282-291
Number of pages10
JournalTheoretical Computer Science
Volume429
Publication statusPublished - 2012

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'A graph theoretic approach to automata minimality'. Together they form a unique fingerprint.

Cite this