Travelled to:1 × Denmark
1 × Finland
1 × Iceland
1 × Latvia
1 × Portugal
1 × United Kingdom
2 × France
Collaborated with:∅ A.Maletti A.Okhotin
Talks about:equat (4) recompress (3) conjunct (3) automata (3) grammar (3) word (3) determinist (2) regular (2) languag (2) generat (2)
Person: Artur Jez
DBLP: Jez:Artur
Contributed to:
2014
20132013
2012201320122011200820072008
2020Wrote 12 papers:
- ICALP-v2-2014-Jez #unification
- Context Unification is in PSPACE (AJ), pp. 244–255.
- DLT-2013-Jez #equation #named #word
- Recompression: Word Equations and Beyond (AJ), pp. 12–26.
- DLT-2013-JezO #ambiguity #boolean grammar
- Unambiguous Conjunctive Grammars over a One-Letter Alphabet (AJ, AO), pp. 277–288.
- ICALP-v2-2013-Jez #equation #linear #word
- One-Variable Word Equations in Linear Time (AJ), pp. 324–335.
- CIAA-2012-JezM #automaton
- Hyper-minimization for Deterministic Tree Automata (AJ, AM), pp. 217–228.
- CIAA-J-2012-JezM13 #automaton
- Hyper-Minimization for Deterministic Tree Automata (AJ, AM), pp. 815–830.
- ICALP-v1-2012-Jez #pattern matching #performance
- Faster Fully Compressed Pattern Matching by Recompression (AJ), pp. 533–544.
- CIAA-2011-JezM #automaton #performance
- Computing All ℓ-Cover Automata Fast (AJ, AM), pp. 203–214.
- ICALP-B-2008-JezO #equation #on the #set
- On the Computational Completeness of Equations over Sets of Natural Numbers (AJ, AO), pp. 63–74.
- DLT-2007-Jez #boolean grammar
- Conjunctive Grammars Can Generate Non-regular Unary Languages (AJ), pp. 242–253.
- DLT-J-2007-Jez08 #boolean grammar
- Conjunctive Grammars Generate Non-Regular Unary Languages (AJ), pp. 597–615.
- CSL-2020-Jez #equation #problem #unification #word
- Solving Word Equations (And Other Unification Problems) by Recompression (Invited Talk) (AJ), p. 17.