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

J Daciuk

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

J Daciuk^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

13 Citations (Scopus)

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.

Original language	English
Title of host publication	IMPLEMENTATION AND APPLICATION OF AUTOMATA
Editors	JM Champarnaud, D Maurel
Place of Publication	BERLIN
Publisher	Springer
Pages	255-261
Number of pages	7
ISBN (Print)	3-540-40391-4
Publication status	Published - 2003
Event	7th International Conference on Implementation and Application of Automata - , France Duration: 3-Jul-2002 → 5-Jul-2002

Publication series

Name	LECTURE NOTES IN COMPUTER SCIENCE
Publisher	SPRINGER-VERLAG BERLIN
Volume	2608
ISSN (Print)	0302-9743

Other

Other	7th International Conference on Implementation and Application of Automata
Country/Territory	France
Period	03/07/2002 → 05/07/2002

Handle.net

Persistent link

Cite this

@inproceedings{c9bb0824d63c433aa8b69b3059499ade,

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

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.",

author = "J Daciuk",

year = "2003",

language = "English",

isbn = "3-540-40391-4",

series = "LECTURE NOTES IN COMPUTER SCIENCE",

publisher = "Springer",

pages = "255--261",

editor = "JM Champarnaud and D Maurel",

booktitle = "IMPLEMENTATION AND APPLICATION OF AUTOMATA",

note = "7th International Conference on Implementation and Application of Automata ; Conference date: 03-07-2002 Through 05-07-2002",

}

Daciuk, J 2003, Comparison of construction algorithms for minimal, acyclic, deterministic, finite-state automata from sets of strings. in JM Champarnaud & D Maurel (eds), IMPLEMENTATION AND APPLICATION OF AUTOMATA. LECTURE NOTES IN COMPUTER SCIENCE, vol. 2608, Springer, BERLIN, pp. 255-261, 7th International Conference on Implementation and Application of Automata, France, 03/07/2002.

Comparison of construction algorithms for minimal, acyclic, deterministic, finite-state automata from sets of strings. / Daciuk, J.
IMPLEMENTATION AND APPLICATION OF AUTOMATA. ed. / JM Champarnaud; D Maurel. BERLIN: Springer, 2003. p. 255-261 (LECTURE NOTES IN COMPUTER SCIENCE; Vol. 2608).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

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

AU - Daciuk, J

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

M3 - Conference contribution

SN - 3-540-40391-4

T3 - LECTURE NOTES IN COMPUTER SCIENCE

SP - 255

EP - 261

BT - IMPLEMENTATION AND APPLICATION OF AUTOMATA

A2 - Champarnaud, JM

A2 - Maurel, D

PB - Springer

CY - BERLIN

T2 - 7th International Conference on Implementation and Application of Automata

Y2 - 3 July 2002 through 5 July 2002

ER -

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

Abstract

Publication series

Other

Handle.net

Fingerprint

Cite this