Travelled to:1 × Canada
1 × Czech Republic
1 × Germany
1 × South Africa
3 × France
Collaborated with:∅ D.Weiss G.v.Noord R.C.Carrasco M.L.Forcada D.Maurel A.Savary
Talks about:automata (6) minim (3) finit (3) determinist (2) represent (2) increment (2) construct (2) state (2) comparison (1) treatment (1)
Person: Jan Daciuk
DBLP: Daciuk:Jan
Contributed to:
2011200720052002200120001999Wrote 7 papers:
- CIAA-2011-DaciukW #automaton #finite #representation
- Smaller Representation of Finite State Automata (JD, DW), pp. 118–129.
- CIAA-2007-CarrascoDF #automaton #implementation
- An Implementation of Deterministic Tree Automata Minimization (RCC, JD, MLF), pp. 122–129.
- CIAA-2005-DaciukMS #automaton #incremental #pseudo
- Incremental and Semi-incremental Construction of Pseudo-Minimal Automata (JD, DM, AS), pp. 341–342.
- CIAA-2002-Daciuk #algorithm #automaton #comparison #finite #set #string
- Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings (JD), pp. 255–261.
- CIAA-2001-DaciukN #automaton #finite #modelling #representation
- Finite Automata for Compact Representation of Language Models in NLP (JD, GvN), pp. 65–73.
- CIAA-2000-Daciuk #automaton
- Experiments with Automata Compression (JD), pp. 105–112.
- WIA-1999-Daciuk #word
- Treatment of Unknown Words (JD), pp. 71–80.