Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Jan Daciuk
Observed names:
Daciuk, J.,
Daciuk, Jan,
JAN DACIUK
Observed institutions:
Gdańsk University of Technology,
University of Groningen,
Laboratoire d'Informatique Fondamentale et Appliquée de Tours
OpenAlex ID:
A5004158565
Incremental Construction of Minimal Acyclic Finite-State Automata
2000
·
Jan Daciuk
, Stoyan Mihov
, et al.
·
Computational Linguistics
·
181
PDF
Incremental construction of minimal acyclic finite state automata and transducers
1998
·
Jan Daciuk
, Bruce W. Watson
, et al.
·
57
PDF
Incremental construction of minimal acyclic finite-state automata
2000
·
Daciuk, Jan
, Mihov, Stoyan
, et al.
·
arXiv (Cornell University)
·
50
PDF
An efficient incremental DFA minimization algorithm
2003
·
BRUCE W. WATSON
, JAN DACIUK
·
Natural Language Engineering
·
36
Experiments with Automata Compression
2001
·
Jan Daciuk
·
Lecture notes in computer science
·
20
Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings
2003
·
Jan Daciuk
·
Lecture notes in computer science
·
18
Smaller Representation of Finite State Automata
2011
·
Jan Daciuk
, Dawid Weiss
·
Lecture notes in computer science
·
13
Incremental Construction of Minimal Tree Automata
2008
·
Rafael C. Carrasco
, Jan Daciuk
, et al.
·
Algorithmica
·
13
An Implementation of Deterministic Tree Automata Minimization
2007
·
Rafael C. Carrasco
, Jan Daciuk
, et al.
·
Springer eBooks
·
13
Finite State tools for Natural Language Processing
2000
·
Daciuk, J.
, Zajac, R
·
University of Groningen research database (University of Groningen / Centre for Information Technology)
·
12
Finite Automata for Compact Representation of Language Models in NLP
2002
·
Jan Daciuk
, Gertjan van Noord
·
Lecture notes in computer science
·
9
Gazetteer Compression Technique Based on Substructure Recognition
2007
·
Jan Daciuk
, Jakub Piskorski
·
Springer eBooks
·
8
Algorithms for Linguistic Processing, NWO PIONIER, Progress Report
2002
·
van der Beek, L.J.
, Daciuk, J.
, et al.
·
University of Groningen research database (University of Groningen / Centre for Information Technology)
·
8
Semi-incremental Addition of Strings to a Cyclic Finite Automaton
2004
·
Jan Daciuk
·
Springer eBooks
·
7
Finite automata for compact representation of tuple dictionaries
2003
·
Jan Daciuk
, Gertjan van Noord
·
Theoretical Computer Science
·
7
Treatment of Unknown Words
2001
·
Jan Daciuk
·
Lecture notes in computer science
·
7
Algorithms for Linguistic Processing
1999
·
L.J. van der Beek
, Gosse Bouma
, et al.
·
6
Natural Language Dictionaries Implemented as Finite Automata
2010
·
Jan Daciuk
, Jakub Piskorski
, et al.
·
Mathematics, computing, language, and life
·
5
Treatment of Unknown Words
2001
·
Jan Daciuk
·
5
Optimization of Automata
2014
·
Jan Daciuk
·
4
Dynamic Perfect Hashing with Finite-State Automata
2006
·
Jan Daciuk
, Denis Maurel
, et al.
·
Springer eBooks
·
4
Comments on “Incremental Construction and Maintenance of Minimal Finite-State Automata,” by Rafael C. Carrasco and Mikel L. Forcada
2004
·
Jan Daciuk
·
Computational Linguistics
·
4
PDF
Smaller representation of finite state automata
2012
·
Jan Daciuk
, Dawid Weiss
·
Theoretical Computer Science
·
3
PDF
Incremental and Semi-incremental Construction of Pseudo-Minimal Automata
2006
·
Jan Daciuk
, Denis Maurel
, et al.
·
Lecture notes in computer science
·
3
Minimization of unary symmetric difference NFAs.
2005
·
Lynette van Zijl
, Graham Müller
, et al.
·
South African Computer Journal
·
3
Show more works
View as search
Works count:
41
Citation count:
500
H-index:
10
I10-index:
10
Year
Topic
Type
