2008 - ACM Distinguished Member
Jeffrey Shallit focuses on Combinatorics, Discrete mathematics, Finite-state machine, Regular language and Binary number. His studies deal with areas such as Deterministic finite automaton, Quantum finite automata, Function and Thue–Morse sequence, Sequence as well as Combinatorics. Jeffrey Shallit mostly deals with Integer in his studies of Discrete mathematics.
The concepts of his Regular language study are interwoven with issues in Unary operation and Kleene star. His Binary number research integrates issues from Fraction, Quotient, Decimal and Fractional power. His Morphism research includes elements of Model of computation and Formal power series.
Jeffrey Shallit mainly investigates Combinatorics, Discrete mathematics, Sequence, Word and Regular language. His work carried out in the field of Combinatorics brings together such families of science as Function, Upper and lower bounds and Binary number. His research in Discrete mathematics is mostly focused on Decidability.
His study in Automatic sequence and Thue–Morse sequence is carried out as part of his studies in Sequence. His biological study spans a wide range of topics, including Morphism and Exponent. His research on Regular language frequently links to adjacent areas such as Algebra.
His scientific interests lie mostly in Combinatorics, Discrete mathematics, Word, Sequence and Binary number. His research ties Upper and lower bounds and Combinatorics together. His work on Decidability as part of general Discrete mathematics research is frequently linked to Critical exponent, thereby connecting diverse disciplines of science.
His Word research is multidisciplinary, incorporating elements of Queen, Morphism, Nondeterministic finite automaton, Order and Exponent. His study on Sequence also encompasses disciplines like
Jeffrey Shallit mostly deals with Combinatorics, Discrete mathematics, Binary number, Word and Word. In the field of Combinatorics, his study on Number theory, Permutation and Morphism overlaps with subjects such as Palindrome. His Discrete mathematics study integrates concerns from other disciplines, such as Automated theorem proving, Computation and Combinatorics on words.
His Binary number research incorporates themes from Time complexity, Natural number and Existential quantification. The study incorporates disciplines such as Generalization, State complexity and De Bruijn sequence in addition to Word. His Word research incorporates elements of Queen, Exponent, Position and Real number.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Automatic Sequences: Theory, Applications, Generalizations
Jean-Paul Allouche;Jeffrey Shallit.
Algorithmic number theory
Eric Bach;Jeffrey Shallit.
The Ubiquitous Prouhet-Thue-Morse Sequence
Jean-Paul Allouche;Jeffrey O. Shallit.
The ring of k -regular sequences, II
Jean-Paul Allouche;Jeffrey Shallit.
Theoretical Computer Science (2003)
A Second Course in Formal Languages and Automata Theory
Regular expressions: new results and open problems
Keith Ellul;Bryan Krawetz;Jeffrey Shallit;Ming-wei Wang.
descriptional complexity of formal systems (2004)
A lower bound technique for the size of nondeterministic finite automata
Ian Glaister;Jeffrey Shallit.
Information Processing Letters (1996)
UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
Giovanni Pighizzini;Jeffrey O. Shallit.
International Journal of Foundations of Computer Science (2002)
Randomized algorithms in number theory
J. O. Rabin;Jeffrey Shallit.
Communications on Pure and Applied Mathematics (1985)
The Computational Complexity of Some Problems of Linear Algebra
Jonathan F Buss;Gudmund S Frandsen;Jeffrey O Shallit.
Journal of Computer and System Sciences (1999)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: