Alex Kruckman
University of California, Berkeley
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Alex Kruckman.
GandALF | 2012
Alex Kruckman; Sasha Rubin; John Sheridan; Ben Zax
An automaton with advice is a finite state automaton which has access to an additional fixed infinite string called an advice tape. We refine the Myhill-Nerode theorem to characterize the languages of finite strings that are accepted by automata with advice. We do the same for tree automata with advice.
Journal of Logic, Language and Information | 2016
Alex Kruckman; Lawrence Valby
An action is a pair of sets, C and S, and a function
arXiv: Probability | 2008
Dennis Jang; Jung Uk Kang; Alex Kruckman; Jun Kudo; Steven J. Miller
arXiv: Logic | 2017
Nathanael Leedom Ackerman; Cameron E. Freer; Alex Kruckman; Rehana Patel
f:C\times S \rightarrow C
arXiv: Logic | 2017
Gabriel Conant; Alex Kruckman
Archive | 2016
Alex Kruckman
f:C×S→C. Rothschild and Yalcin gave a simple axiomatic characterization of those actions arising from set intersection, i.e. for which the elements of C and S can be identified with sets in such a way that elements of S act on elements of C by intersection. We introduce and axiomatically characterize two natural classes of actions which arise from set intersection and union. In the first class, the
arXiv: Logic | 2018
Alex Kruckman; Lawrence S. Moss
arXiv: Logic | 2018
Alex Kruckman; Aristotelis Panagiotopoulos
\uparrow \!\!\downarrow
arXiv: Logic | 2017
Siddharth Bhaskar; Alex Kruckman
Archive | 2017
Siddharth Bhaskar; Alex Kruckman
↑↓-actions, each element of S is identified with a pair of sets