Jan Daciuk

According to our database1, Jan Daciuk authored at least 20 papers between 1999 and 2015.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2015
Preserving Trees in Minimal Automata.
Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing, 2015

2012
Incremental Construction of Finite-State Automata.
Proceedings of the Handbook of Finite State Based Models and Applications., 2012

Smaller representation of finite state automata.
Theor. Comput. Sci., 2012

2010
Natural Language Dictionaries Implemented as Finite Automata.
Proceedings of the Scientific Applications of Language Methods., 2010

2009
A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata.
RAIRO Theor. Informatics Appl., 2009

Incremental Construction of Minimal Tree Automata.
Algorithmica, 2009

2007
An Implementation of Deterministic Tree Automata Minimization.
Proceedings of the Implementation and Application of Automata, 2007

2006
Gazetteer Compression Technique Based on Substructure Recognition.
Proceedings of the Intelligent Information Processing and Web Mining, 2006

2005
Minimization of unary symmetric difference NFAs.
South Afr. Comput. J., 2005

Incremental and Semi-incremental Construction of Pseudo-Minimal Automata.
Proceedings of the Implementation and Application of Automata, 2005

Dynamic Perfect Hashing with Finite-State Automata.
Proceedings of the Intelligent Information Processing and Web Mining, 2005

2004
Finite automata for compact representation of tuple dictionaries.
Theor. Comput. Sci., 2004

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

Semi-incremental Addition of Strings to a Cyclic Finite Automaton.
Proceedings of the Intelligent Information Processing and Web Mining, 2004

2003
An efficient incremental DFA minimization algorithm.
Nat. Lang. Eng., 2003

2002
Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings.
Proceedings of the Implementation and Application of Automata, 2002

2001
Finite Automata for Compact Representation of Language Models in NLP.
Proceedings of the Implementation and Application of Automata, 2001

2000
Incremental Construction of Minimal Acyclic Finite State Automata.
Comput. Linguistics, 2000

Experiments with Automata Compression.
Proceedings of the Implementation and Application of Automata, 2000

1999
Treatment of Unknown Words.
Proceedings of the Automata Implementation, 1999


  Loading...