Jan Daciuk

According to our database, Jan Daciuk authored at least 21 papers between 1999 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2015

Preserving Trees in Minimal Automata.

Jan Daciuk

Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing, 2015

2012

Incremental Construction of Finite-State Automata.

Jan Daciuk

Proceedings of the Handbook of Finite State Based Models and Applications., 2012

Smaller representation of finite state automata.

Jan Daciuk, Dawid Weiss

Theor. Comput. Sci., 2012

2010

Natural Language Dictionaries Implemented as Finite Automata.

Jan Daciuk, Jakub Piskorski, Strahil Ristov

Proceedings of the Scientific Applications of Language Methods., 2010

2009

A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata.

Rafael C. Carrasco, Jan Daciuk

RAIRO Theor. Informatics Appl., 2009

Incremental Construction of Minimal Tree Automata.

Rafael C. Carrasco, Jan Daciuk, Mikel L. Forcada

Algorithmica, 2009

2007

An Implementation of Deterministic Tree Automata Minimization.

Rafael C. Carrasco, Jan Daciuk, Mikel L. Forcada

Proceedings of the Implementation and Application of Automata, 2007

2006

Les transducteurs à sorties variables.

Denis Maurel, Jan Daciuk

Proceedings of the Actes de la 13ème conférence sur le Traitement Automatique des Langues Naturelles. Articles longs, 2006

Gazetteer Compression Technique Based on Substructure Recognition.

Jan Daciuk, Jakub Piskorski

Proceedings of the Intelligent Information Processing and Web Mining, 2006

2005

Minimization of unary symmetric difference NFAs.

Lynette van Zijl, Graham Muller, Jan Daciuk

South Afr. Comput. J., 2005

Incremental and Semi-incremental Construction of Pseudo-Minimal Automata.

Jan Daciuk, Denis Maurel, Agata Savary

Proceedings of the Implementation and Application of Automata, 2005

Dynamic Perfect Hashing with Finite-State Automata.

Jan Daciuk, Denis Maurel, Agata Savary

Proceedings of the Intelligent Information Processing and Web Mining, 2005

2004

Finite automata for compact representation of tuple dictionaries.

Jan Daciuk, Gertjan van Noord

Theor. Comput. Sci., 2004

Comments on "Incremental Construction and Maintenance of Minimal Finite-State Automata, " by Rafael C. Carrasco and Mikel L. Forcada.

Jan Daciuk

Comput. Linguistics, 2004

Semi-incremental Addition of Strings to a Cyclic Finite Automaton.

Jan Daciuk

Proceedings of the Intelligent Information Processing and Web Mining, 2004

2003

An efficient incremental DFA minimization algorithm.

Bruce W. Watson, Jan Daciuk

Nat. Lang. Eng., 2003

2002

Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings.

Jan Daciuk

Proceedings of the Implementation and Application of Automata, 2002

2001

Finite Automata for Compact Representation of Language Models in NLP.

Jan Daciuk, Gertjan van Noord

Proceedings of the Implementation and Application of Automata, 2001

2000

Incremental Construction of Minimal Acyclic Finite State Automata.

Jan Daciuk, Stoyan Mihov, Bruce W. Watson, Richard E. Watson

Comput. Linguistics, 2000

Experiments with Automata Compression.

Jan Daciuk

Proceedings of the Implementation and Application of Automata, 2000

1999

Treatment of Unknown Words.

Jan Daciuk

Proceedings of the Automata Implementation, 1999