Comparison of construction algorithms for minimal, acyclic, deterministic, finite-state automata from sets of strings

Daciuk, J

Publication date

January 2003

Publisher

Springer Fachmedien Wiesbaden GmbH

Abstract

This paper compares various methods for constructing minimal, deterministic, acyclic, finite-state automata (recognizers) from sets of words. Incremental, semi-incremental, and non-incremental methods have been implemented and evaluated.</p

Extracted data

We use cookies to provide a better user experience.

Data Protection

Comparison of construction algorithms for minimal, acyclic, deterministic, finite-state automata from sets of strings

Abstract

Extracted data

Comparison of construction algorithms for minimal, acyclic, deterministic, finite-state automata from sets of strings

Abstract

Extracted data

Related items

Related items