Jan Daciuk

23 papers C 6Journal 9Unranked 6
YearRankTypeTitle / Venue / Authors
2015 — conf
Preserving Trees in Minimal Automata.
FSMNLP
Jan Daciuk
2012 — ch.
Incremental Construction of Finite-State Automata.
Handbook of Finite State Based Models and Applications
Jan Daciuk
2012 J jnl
Smaller representation of finite state automata.
Theor. Comput. Sci.
Jan Daciuk, Dawid Weiss
2011 C conf
Smaller Representation of Finite State Automata.
CIAA
Jan Daciuk, Dawid Weiss
2010 — ch.
Natural Language Dictionaries Implemented as Finite Automata.
Scientific Applications of Language Methods
Jan Daciuk, Jakub Piskorski, Strahil Ristov
2009 J jnl
A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata.
RAIRO Theor. Informatics Appl.
Rafael C. Carrasco, Jan Daciuk
2009 J jnl
Incremental Construction of Minimal Tree Automata.
Algorithmica
Rafael C. Carrasco, Jan Daciuk, Mikel L. Forcada
2007 C conf
An Implementation of Deterministic Tree Automata Minimization.
CIAA
Rafael C. Carrasco, Jan Daciuk, Mikel L. Forcada
2006 — conf
Gazetteer Compression Technique Based on Substructure Recognition.
Intelligent Information Systems
Jan Daciuk, Jakub Piskorski
2006 — conf
Les transducteurs à sorties variables.
TALN (Articles longs)
Denis Maurel, Jan Daciuk
2005 — conf
Dynamic Perfect Hashing with Finite-State Automata.
Intelligent Information Systems
Jan Daciuk, Denis Maurel, Agata Savary
2005 C conf
Incremental and Semi-incremental Construction of Pseudo-Minimal Automata.
CIAA
Jan Daciuk, Denis Maurel, Agata Savary
2005 J jnl
Minimization of unary symmetric difference NFAs.
South Afr. Comput. J.
Lynette van Zijl, Graham Muller, Jan Daciuk
2004 J jnl
Comments on "Incremental Construction and Maintenance of Minimal Finite-State Automata, " by Rafael C. Carrasco and Mikel L. Forcada.
Comput. Linguistics
Jan Daciuk
2004 J jnl
Finite automata for compact representation of tuple dictionaries.
Theor. Comput. Sci.
Jan Daciuk, Gertjan van Noord
2004 — conf
Semi-incremental Addition of Strings to a Cyclic Finite Automaton.
Intelligent Information Systems
Jan Daciuk
2003 J jnl
An efficient incremental DFA minimization algorithm.
Nat. Lang. Eng.
Bruce W. Watson, Jan Daciuk
2002 C conf
Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings.
CIAA
Jan Daciuk
2001 C conf
Finite Automata for Compact Representation of Language Models in NLP.
CIAA
Jan Daciuk, Gertjan van Noord
2000 C conf
Experiments with Automata Compression.
CIAA
Jan Daciuk
2000 J jnl
Incremental Construction of Minimal Acyclic Finite State Automata.
Comput. Linguistics
Jan Daciuk, Stoyan Mihov, Bruce W. Watson, Richard E. Watson
2000 J jnl
Incremental construction of minimal acyclic finite-state automata
CoRR
Jan Daciuk, Stoyan Mihov, Bruce W. Watson, Richard E. Watson
1999 — conf
Treatment of Unknown Words.
WIA
Jan Daciuk