The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jan Daciuk: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jan Daciuk
    Semi-incremental Addition of Strings to a Cyclic Finite Automaton. [Citation Graph (0, 0)][DBLP]
    Intelligent Information Systems, 2004, pp:201-207 [Conf]
  2. Jan Daciuk, Denis Maurel, Agata Savary
    Dynamic Perfect Hashing with Finite-State Automata. [Citation Graph (0, 0)][DBLP]
    Intelligent Information Systems, 2005, pp:169-178 [Conf]
  3. Jan Daciuk
    Experiments with Automata Compression. [Citation Graph (0, 0)][DBLP]
    CIAA, 2000, pp:105-112 [Conf]
  4. Jan Daciuk
    Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:255-261 [Conf]
  5. Jan Daciuk
    Treatment of Unknown Words. [Citation Graph (0, 0)][DBLP]
    WIA, 1999, pp:71-80 [Conf]
  6. Jan Daciuk, Denis Maurel, Agata Savary
    Incremental and Semi-incremental Construction of Pseudo-Minimal Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:341-342 [Conf]
  7. Jan Daciuk, Gertjan van Noord
    Finite Automata for Compact Representation of Language Models in NLP. [Citation Graph (0, 0)][DBLP]
    CIAA, 2001, pp:65-73 [Conf]
  8. Jan Daciuk
    Comments on "Incremental Construction and Maintenance of Minimal Finite-State Automata, " by Rafael C. Carrasco and Mikel L. Forcada. [Citation Graph (0, 0)][DBLP]
    Computational Linguistics, 2004, v:30, n:2, pp:227-235 [Journal]
  9. Jan Daciuk, Stoyan Mihov, Bruce W. Watson, Richard Watson
    Incremental Construction of Minimal Acyclic Finite State Automata. [Citation Graph (0, 0)][DBLP]
    Computational Linguistics, 2000, v:26, n:1, pp:3-16 [Journal]
  10. Jan Daciuk, Stoyan Mihov, Bruce W. Watson, Richard Watson
    Incremental construction of minimal acyclic finite-state automata [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  11. Lynette van Zijl, Graham Muller, Jan Daciuk
    Minimization of unary symmetric difference NFAs. [Citation Graph (0, 0)][DBLP]
    South African Computer Journal, 2005, v:34, n:, pp:69-75 [Journal]
  12. Jan Daciuk, Gertjan van Noord
    Finite automata for compact representation of tuple dictionaries. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:313, n:1, pp:45-56 [Journal]
  13. Rafael C. Carrasco, Jan Daciuk, Mikel L. Forcada
    An Implementation of Deterministic Tree Automata Minimization. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:122-129 [Conf]

  14. Incremental Construction of Minimal Tree Automata. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002