Skip to main content
Article thumbnail
Location of Repository

Efficient Algorithms for Finite Automata

By Martin Hruška


Nondeterministic finite automata are used in many areas of computer science, including, but not limited to, formal verification, the design of digital circuits or for the representation of a regular language. Their advantages over deterministic finite automata is that they may represent a language in even exponentially conciser way. However, this advantage may be lost if a naive approach to some operations is taken, in particular for checking language inclusion of a pair of automata, the naive implementation of which performs an explicit determinization of one of the automata. Recently, several new techniques for this operation that avoid explicit determinization (using the so-called antichains or bisimulation up to congruence) have been proposed. The main goal of the presented work is to efficiently implement these techniques as a new extension of the VATA library. The implementation has been evaluated and is superior to other implementations in over 90% of tested cases by the factor of 2 to 100

Topics: bisimulation up to congruence; antichains; finite automata; language inclusion; formal verification; jazyková inkluze; knihovna VATA; formální verifikace; antichain; bisimulace vzhůru ke kongruenci; konečné automaty; VATA library
Publisher: Vysoké učení technické v Brně. Fakulta informačních technologií
Year: 2013
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.