Taylor J. Smith

Orcid: 0000-0001-7838-3409

Affiliations:
  • Queen's University at Kingston, School of Computing, ON, Canada
  • University of Waterloo, School of Computer Science, ON, Canada


According to our database1, Taylor J. Smith authored at least 13 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Improved Randomized Approximation of Hard Universality and Emptiness Problems.
CoRR, 2024

2023
Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata.
J. Autom. Lang. Comb., 2023

Descriptional Complexity of Finite Automata - Selected Highlights.
CoRR, 2023

2022
Two-Dimensional Typewriter Automata.
CoRR, 2022

2021
Closure, Decidability, and Complexity Results for Restricted Variants of Two-Dimensional Automata
PhD thesis, 2021

Decision problems and projection languages for restricted variants of two-dimensional automata.
Theor. Comput. Sci., 2021

Degrees of Restriction for Two-Dimensional Automata.
Proceedings of the Implementation and Application of Automata, 2021

Concatenation Operations and Restricted Variants of Two-Dimensional Automata.
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

2019
Site-directed insertion: Language equations and decision problems.
Theor. Comput. Sci., 2019

Decision Problems for Restricted Variants of Two-Dimensional Automata.
Proceedings of the Implementation and Application of Automata, 2019

2018
Site-Directed Insertion: Decision Problems, Maximality and Minimality.
Proceedings of the Descriptional Complexity of Formal Systems, 2018

2017
Periodicity in rectangular arrays.
Inf. Process. Lett., 2017

2016
Periodicity in Rectangular Arrays.
CoRR, 2016


  Loading...