Joey's Computing Blog

Languages, Theory and other Fun Stuff

Publications

Accepted Papers

Joey Eremondi, Oscar H. Ibarra, Ian McQuillan “On the Complexity and Decidability of Some Problems Involving Shuffle” Paper, Descriptional Complexity of Formal Systems, 2015-06-25

Published Papers

Joey Eremondi, Oscar H. Ibarra, Ian McQuillan “Deletion Operations on Deterministic Families of Automata” Paper, Proceedings of the 9th International Conference on Theory and Applications of Models of Computation, 2015-04-16 http://dx.doi.org/10.1007/978-3-319-17142-5_33

Joey Eremondi, Oscar H. Ibarra, Ian McQuillan “Insertion Operations on Deterministic Reversal-Bounded Counter Machines” Paper, Proceedings of the 9th International Conference on Language and Automata Theory and Applications, 2015-02-24 http://dx.doi.org/10.1007/978-3-319-15579-1_15

Joey Eremondi, “The poor mans proof assistant: using prolog to develop formal language theoretic proofs” Paper, SPLASH ‘13: The ACM SIGPLAN conference on Systems, Programming, Languages and Applications: Software for Humanity, 2013-10-28 http://doi.acm.org/10.1145/2508075.2527300

Presentations

“Insertion Operations on Deterministic Reversal-Bounded Counter Machines” Paper talk given at LATA 2015.

Undergraduate Thesis

Joey Eremondi Ian McQuillan (Supervisor), “A Characterization of the Shuffle Inclusion Problem on Pairs of Words of Combined Length 8 or Less (Undergraduate Honours Thesis)”

Posters

“Proving the Impossible: Decidability of Problems with Counter Machines”, 2014 U of S Student’s Union Student Project Symposium, Canada, Saskatchewan, Saskatoon

“The Poor Man’s Proof Assistant: Using Prolog to Develop Formal Language Theoretic Proofs”, The ACM SIGPLAN conference on Systems, Programming, Languages and Applications: Software for Humanity, United States, Indiana, Indianapolis

“Every Day I’m Shuffling: An Exploration of the Shuffle Subset Problem on Words”, 2013 U of S Student’s Union Student Project Symposium, Canada, Saskatchewan, Saskatoon

“Every Day I’m Shuffling: An Exploration of the Shuffle Subset Problem on Words”, University of Saskatchewan Celebrating Success Poster Fair, Canada, Saskatchewan, Saskatoon

“GRAIL-MP: Introducing Paralellism into the Python Interpreter”, U of S NSERC Undergraduate Poster Fair, Canada, Saskatchewan, Saskatoon