default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Daciuk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[c12]Jan Daciuk:
Preserving Trees in Minimal Automata. FSMNLP 2015- 2012
- [j8]Jan Daciuk, Dawid Weiss:
Smaller representation of finite state automata. Theor. Comput. Sci. 450: 10-21 (2012) - [r1]Jan Daciuk:
Incremental Construction of Finite-State Automata. Handbook of Finite State Based Models and Applications 2012: 171-190 - 2011
- [c11]Jan Daciuk, Dawid Weiss:
Smaller Representation of Finite State Automata. CIAA 2011: 118-129 - 2010
- [p1]Jan Daciuk, Jakub Piskorski, Strahil Ristov:
Natural Language Dictionaries Implemented as Finite Automata. Scientific Applications of Language Methods 2010: 133-204
2000 – 2009
- 2009
- [j7]Rafael C. Carrasco, Jan Daciuk, Mikel L. Forcada:
Incremental Construction of Minimal Tree Automata. Algorithmica 55(1): 95-110 (2009) - [j6]Rafael C. Carrasco, Jan Daciuk:
A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata. RAIRO Theor. Informatics Appl. 43(4): 779-790 (2009) - 2007
- [c10]Rafael C. Carrasco, Jan Daciuk, Mikel L. Forcada:
An Implementation of Deterministic Tree Automata Minimization. CIAA 2007: 122-129 - 2006
- [c9]Jan Daciuk, Jakub Piskorski:
Gazetteer Compression Technique Based on Substructure Recognition. Intelligent Information Systems 2006: 87-95 - [c8]Denis Maurel, Jan Daciuk:
Les transducteurs à sorties variables. TALN (Articles longs) 2006: 237-245 - 2005
- [j5]Lynette van Zijl, Graham Muller, Jan Daciuk:
Minimization of unary symmetric difference NFAs. South Afr. Comput. J. 34: 69-75 (2005) - [c7]Jan Daciuk, Denis Maurel, Agata Savary:
Dynamic Perfect Hashing with Finite-State Automata. Intelligent Information Systems 2005: 169-178 - [c6]Jan Daciuk, Denis Maurel, Agata Savary:
Incremental and Semi-incremental Construction of Pseudo-Minimal Automata. CIAA 2005: 341-342 - 2004
- [j4]Jan Daciuk:
Comments on "Incremental Construction and Maintenance of Minimal Finite-State Automata, " by Rafael C. Carrasco and Mikel L. Forcada. Comput. Linguistics 30(2): 227-235 (2004) - [j3]Jan Daciuk, Gertjan van Noord
:
Finite automata for compact representation of tuple dictionaries. Theor. Comput. Sci. 313(1): 45-56 (2004) - [c5]Jan Daciuk:
Semi-incremental Addition of Strings to a Cyclic Finite Automaton. Intelligent Information Systems 2004: 201-207 - 2003
- [j2]Bruce W. Watson, Jan Daciuk:
An efficient incremental DFA minimization algorithm. Nat. Lang. Eng. 9(1): 49-64 (2003) - 2002
- [c4]Jan Daciuk:
Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings. CIAA 2002: 255-261 - 2001
- [c3]Jan Daciuk, Gertjan van Noord:
Finite Automata for Compact Representation of Language Models in NLP. CIAA 2001: 65-73 - 2000
- [j1]Jan Daciuk, Stoyan Mihov, Bruce W. Watson, Richard E. Watson:
Incremental Construction of Minimal Acyclic Finite State Automata. Comput. Linguistics 26(1): 3-16 (2000) - [c2]Jan Daciuk:
Experiments with Automata Compression. CIAA 2000: 105-112 - [i1]Jan Daciuk, Stoyan Mihov, Bruce W. Watson, Richard E. Watson:
Incremental construction of minimal acyclic finite-state automata. CoRR cs.CL/0007009 (2000)
1990 – 1999
- 1999
- [c1]Jan Daciuk:
Treatment of Unknown Words. WIA 1999: 71-80
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
