Travelled to:1 × Czech Republic
1 × Finland
1 × France
1 × Hungary
1 × Italy
1 × Japan
1 × New Zealand
1 × Portugal
1 × Taiwan
1 × USA
1 × United Kingdom
2 × Austria
2 × Germany
3 × Canada
5 × Spain
Collaborated with:∅ N.Rampersad D.Goc J.A.Brzozowski E.Charlier H.Mousavi D.Krieger D.Henshall E.Grant B.Krawetz J.Lawrence M.Domaratzki P.Ochem C.F.Du G.Jirásková E.Rowland P.Gawrychowski M.Ackerman J.Lee G.Pighizzini C.Epifanio F.Mignosi P.C.Bell D.Reidenbach L.Schaeffer K.Saari Z.Xu S.Yu J.Loftus M.Wang E.Bach G.L.Miller T.Harju T.Anderson N.Santean I.Venturini C.Frougny A.Gabriele
Talks about:languag (11) complex (6) automat (6) word (6) theorem (5) regular (5) state (5) formal (4) factor (4) enumer (4)
Person: Jeffrey Shallit
DBLP: Shallit:Jeffrey
Contributed to:
2015
20142013
2013
201220132012201220112012201120102009201120092008201020082007200720082004200520042001200020021999
1992
1984Wrote 35 papers:
- DLT-2015-BellRS #formal method
- Factorization in Formal Languages (PCB, DR, JS), pp. 97–107.
- AFL-2014-DuS #infinity #similarity #word
- Similarity density of the Thue-Morse word with overlap-free infinite binary words (CFD, JS), pp. 231–245.
- DLT-2013-GocSS #complexity
- Subword Complexity and k-Synchronization (DG, LS, JS), pp. 252–263.
- DLT-2013-MousaviS
- Repetition Avoidance in Circular Factors (HM, JS), pp. 384–395.
- LATA-2013-GocMS #on the
- On the Number of Unbordered Factors (DG, HM, JS), pp. 299–310.
- LATA-2013-GocSS #automation #sequence #word
- Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences (DG, KS, JS), pp. 311–322.
- CIAA-2012-GocHS #automation #combinator #word
- Automatic Theorem-Proving in Combinatorics on Words (DG, DH, JS), pp. 180–191.
- CIAA-J-2012-GocHS13 #automation #combinator #word
- Automatic Theorem-Proving in Combinatorics on Words (DG, DH, JS), pp. 781–798.
- DLT-2012-JiraskovaS #complexity
- The State Complexity of Star-Complement-Star (GJ, JS), pp. 380–391.
- LATA-2012-RowlandS #set
- k-Automatic Sets of Rational Numbers (ER, JS), pp. 490–501.
- DLT-2011-CharlierRS #automation #decidability #sequence
- Enumeration and Decidable Properties of Automatic Sequences (EC, NR, JS), pp. 165–179.
- DLT-2011-Shallit #revisited #theorem
- Fife’s Theorem Revisited (JS), pp. 397–405.
- DLT-J-2011-CharlierRS12 #automation #decidability #sequence
- Enumeration and Decidable Properties of Automatic Sequences (EC, NR, JS), pp. 1035–1066.
- LATA-2011-CharlierDHS #finite
- Finite Orbits of Language Operations (EC, MD, TH, JS), pp. 204–215.
- CIAA-2010-EpifanioFGMS #graph #lazy evaluation #on the
- On Lazy Representations and Sturmian Graphs (CE, CF, AG, FM, JS), pp. 125–134.
- DLT-2009-BrzozowskiGS #formal method #theorem
- Closures in Formal Languages and Kuratowski’s Theorem (JAB, EG, JS), pp. 125–144.
- DLT-J-2009-BrzozowskiGS11 #formal method #theorem
- Closures in Formal Languages and Kuratowski’s Theorem (JAB, EG, JS), pp. 301–321.
- LATA-2009-BrzozowskiSX #problem
- Decision Problems for Convex Languages (JAB, JS, ZX), pp. 247–258.
- DLT-2008-GawrychowskiKRS #context-free grammar #polynomial
- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time (PG, DK, NR, JS), pp. 339–358.
- DLT-2008-Shallit #problem
- The Frobenius Problem and Its Generalizations (JS), pp. 72–83.
- DLT-J-2008-GawrychowskiKRS10 #context-free grammar #polynomial
- Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time (PG, DK, NR, JS), pp. 597–618.
- LATA-2008-AndersonRSS #automaton #finite
- Finite Automata, Palindromes, Powers, and Patterns (TA, NR, NS, JS), pp. 52–63.
- CIAA-2007-AckermanS #performance #regular expression
- Efficient Enumeration of Regular Languages (MA, JS), pp. 226–242.
- DLT-2007-KriegerORS #approximate
- Avoiding Approximate Squares (DK, PO, NR, JS), pp. 278–289.
- DLT-J-2007-OchemRS08 #approximate
- Avoiding Approximate Squares (PO, NR, JS), pp. 633–648.
- CIAA-2004-KrawetzLS #complexity #finite #monad #set
- State Complexity and the Monoid of Transformations of a Finite Set (BK, JL, JS), pp. 213–224.
- CIAA-2004-LeeS #regular expression
- Enumerating Regular Expressions and Their Languages (JL, JS), pp. 2–22.
- CIAA-J-2004-KrawetzLS05 #complexity #finite #monad #set
- State complexity and the monoid of transformations of a finite set (BK, JL, JS), pp. 547–563.
- DLT-2004-EpifanioMSV #graph
- Sturmian Graphs and a Conjecture of Moser (CE, FM, JS, IV), pp. 175–187.
- DLT-2001-DomaratzkiSY #formal method
- Minimal Covers of Formal Languages (MD, JS, SY), pp. 319–329.
- CIAA-2000-Shallit #complexity
- State Complexity and Jacobsthal’s Function (JS), pp. 272–278.
- CIAA-J-2000-PighizziniS02 #complexity
- Unary Language Operations, State Complexity and Jacobsthal’s Function (GP, JS), pp. 145–159.
- DLT-1999-LoftusSW #problem
- New problems of pattern avoidance (JL, JS, MwW), pp. 185–199.
- ICALP-1992-Shallit #linear #set
- Numeration Systems, Linear Recurrences, and Regular Sets (JS), pp. 89–100.
- STOC-1984-BachMS
- Sums of Divisors, Perfect Numbers, and Factoring (EB, GLM, JS), pp. 183–190.