This paper is a follow-up to Jan Daciuk's experiments on space-efficient finite state automata
representation that can be used directly for traversals in main memory (Daciuk, 2000)[4]. We
investigate several techniques for reducing the memory footprint of minimal automata …

… 171 Jan Daciuk 9 Esterel and the Semantics of Causality..... 191 Mohammad Reza
Mousavi 10 Regular Path Queries on Graph-Structured Data …

… Associa- tion for Computational Linguistics. Leonoor van der Beek, Gosse Bouma, Jan
Daciuk, Tanja Gaustad, Robert Malouf, Gertjan van Noord, Robbert Prins, and Begoña
Villada. 2002. Chapter 5. the Alpino dependency treebank …

… We used Jan Daciuk's fsa tools3 which are able to convert a sorted set of strings to a deterministic
acyclic finite state automaton usable for (static) minimal perfect hashing, ie string↔ number
translation, where the number is a rank in the sorted set of strings …

… 201 Jan Daciuk Semi-automatic stemmer evaluation..... 209 Leo Galambos
Development of a Pediatric Text-Corpus for Part-of-Speech Tagging..... 219
John Pestian, Łukasz Itert, Whodzisław Duch Page 11 …

… The paper presents a new implementation of some of Jan Daciuk's algorithms and tools for
morphological analysis based on finite state automata [1]. In particular, we offer a reimplemented
version of the tool which builds the automata from an input set of strings and of the tool …

This book is conceived as an effort to gather all algorithms and methods developed by the
author of the book that concern three aspects of optimization of automata: incrementality,
hashing and compression. Some related algorithms and methods are given as well when …

… We use an approach of Jan Daciuk (Daciuk, 1998), who in- vented an algorithm for both space
and time efficient build- ing of minimal deterministic acyclic finite state automata (DAFSA). On
his pages he offers source codes of tools Page 108 … 5. References Jan Daciuk. 1998 …

… minimization algorithm, by Bruce W. Watson, Workshop on Finite State Method in Natural
Language Processing (FSMNLP '01), 2001”, and “An efficient incremental DFA minimization
algorithm, by Bruce W. Watson and Jan Daciuk, Natural Language Engineering, 9(1), 2003, pp …

… Morph-it (Zanchetta and Baroni, 2005) an open source lexicon that can be compiled using
various packages implementing Finite State Automata (FSA) for two- level morphology
(SFST-Stuttgart Finite State Trans- ducer Tools and Jan Daciuk's FSA utilities) …