I received a PhD from Stony Brook University
for my work in Mathematical Linguistics.
Specifically I work in factoring complicated patterns
and the learning thereof
using simple (subregular) descriptive techniques.
Over the years I have been building an interactive
theorem-prover for subregular logics.
Implemented in Haskell as both a library and supporting command-line tools,
the Language Toolkit (LTK) enables somewhat easy translation from
constraints to automata (and, in some cases, the reverse translation).
For any regular language, LTK can also determine
which of the simple single-relation subregular classes
that language is in.
Dakotah Lambert, Margaret Fero, Andrew Dai, and James Rogers. 2014.
A workbench for logically definable stringsets.
In Proceedings of the 2014 Midstates Conference for
Undegraduate Research in Computer Science and Mathematics,
James Rogers, Jeffrey Heinz, Margaret Fero, Jeremy Hurst,
Dakotah Lambert, and Sean Wibel. 2012.
Cognitive and sub-regular complexity.
In Glyn Morrill and Mark-Jan Nederhof, editor,
Formal Grammar 2012,
volume 8036 of Lecture Notes in Computer Science,