PhD and MSc Theses

PhD and MSc Theses, since 1988

Advisor PROFESSOR EMERITUS Michael Kaminski
Advisor’s Email
Advisor’s Home-Site
No of theses 16
Department Computer Science
Department Web Site
Student’s Name Graduation Year Degree Abstracts Research Name
Aizikowitz Tamar 2011 PhD Abstracts Synchronized Alternating Pushdown Automata
Tan Tony 2009 PhD Abstracts Pebble Automata for Data Languages: Separation, Decidability and Undecidability
Bshouty Nader 1989 PhD Bounds on Multiplicative Complexity of Sets of Bilinear Form
Yariv Yael 2001 MSc An Alternative Semantics of Temporal Logic of Actions
Peterfreund Liat 2015 MSc Abstracts Closure under Reversal of Languages over Infinite Alphabets: A Case Study
Genkin Daniel 2011 MSc Abstracts Radical Lexicalization of Mildly Context-Sensitive Languages
Carmi Adam 2010 MSc Abstracts Adaptive Multi-Pass Parsing
Dubov Yulia 2008 MSc Abstracts Infinite Alphabet Pushdown Automata: Various Approaches and Comparison of Their Consequences
Gross Ron 2008 MSc Abstracts Invariance under Stuttering in Branching-Time Temporal Logic
Grimberg Benjamin 2007 MSc Abstracts Minimal Model semantics for First-Order Ground Non-Monotonic Modal Logic
Zeitlin Daniel 2006 MSc Abstracts Look-Ahead Finite-Memory Automata
Mosin Julia 2001 MSc Base Dependence of Extensions for Open Default Theories
Artzi Shay 2000 MSc Lower Bounds on the Complexity of Polynomail Multiplication Over Finite Fields
Rey Guy 2000 MSc First-Order Non-Monotonic Logic
Zbar Yael 2000 MSc Open Default Theories
Tal Arie 1999 MSc Decidability of Inclusion for Unification Based Automata