Math and Computer Science
Office Location: AC-2D04
|Mon Wed||4:00 - 5:00 PM|
Degree Institution Field Dates PhD Cornell University Mathematics 2008 MS Cornell University Mathematics 2007
Weighted automata are powerful finite-state machines in which the transitions have weights associated to them. Dr. Carta studies weighted automata and their connection to formal languages.
Recurrence equations define sequences using recursion. Dr Carta's current research deals with recursively defined sequences of elements from a semiring, and their connection to weighted automata.
Pushdown automata (PDAs) are computational models, particularly useful in compiler design and linguistics. Dr. Carta studies PDAs, viewed as weighted automata, and context-free languages, viewed as algebraic objects.
Areas of Expertise
- Weighted Automata and Formal Languages
Recurrence Equations with Coefficients in a Semiring
Pushdown Automata and Context-Free Languages
Articles in Field Of Expertise
P. Babaali, E. Carta-Gerardino and C. Knaplund. "The number of DFAs for a given spanning tree." The Journal of Supercomputing. 2013: .
Refereed Proceedings in Field Of Expertise
P. Babaali, E. Carta-Gerardino and C. Knaplund. "The Number of DFAs Produced by a Given Spanning Tree." Proceedings of the 2011 International Conference on Scientific Computing, CSC. 2011: .
E. Carta-Gerardino. "The z-Transform and Automata-Recognizable Systems of Nonhomogeneous Linear Recurrence Equations over Semirings." Proceedings of the 2009 International Conference on Scientific Computing, CSC. 2009: .
Presented Papers, Lectures, and Exhibitions and Performances
" Representing Context-Free Languages with Weighted Automata over Monoids " with S. Jadoonanan, April 2012: Research Day at York College.
" The Impact of MyMathLab " October 2011: Mathematics Education Seminar Series.
" The Number of DFAs Produced by a Given Spanning Tree " with P. Babaali, July 2011: The World Congress in Computer Science, Computer Engineering, and Applied Computing, Las Vegas.
" On the Distribution of the Number of Automata for a Given Tree " with C. Knaplund, April 2011: Research Day at York College.
" On the Distribution of the Number of Automata for a Given Tree " with C. Knaplund, January 2011: Poster Session at the Joint Meetings of the MAA and AMS, New Orleans.
" Weighted Automata over a One-Letter Alphabet, and the Outputs They Generate " with C. Knaplund, April 2010: Research Day at York College.
" The z-Transform and Automata-Recognizable Nonhomogeneous Linear Recurrence Equations " July 2009: The World Congress in Computer Science, Computer Engineering, and Applied Computing, Las Vegas.
Professional Honors, Prizes, Fellowships
NSF VIGRE Fellowship: Fall 2001 - Spring 2004.
Summer REU at York College, Project title: "On the Distribution of the Number of Automata for a Given Tree". Summer 2010: $1000.
PSC-CUNY 40, Project title: "Automata, Transducers, and Linear Recurrence Equations over Semirings". Summer 2009: $2960.