Authors
Citation
D. Maurel, Pseudo-minimal transducer, THEOR COMP, 231(1), 2000, pp. 129-139
Citations number
10
Categorie Soggetti
Computer Science & Engineering
Journal title
THEORETICAL COMPUTER SCIENCE
ISSN journal
03043975
→ ACNP
Volume
231
Issue
1
Year of publication
2000
Pages
129 - 139
Database
ISI
SICI code
0304-3975(20000117)231:1<129:PT>2.0.ZU;2-Z
Abstract
The algorithm that we present here builds an acyclic deterministic finite s
tate machine (automaton or transducer), as each word recognized has a prope
r element, i.e, a transition or a final state that belongs only to the reco
gnizing path of this word. (C) 2000 Elsevier Science B.V. All rights reserv
ed.