关注
Christos Kapoutsis
标题
引用次数
引用次数
年份
Removing bidirectionality from nondeterministic finite automata
CA Kapoutsis
International Symposium on Mathematical Foundations of Computer Science, 544-555, 2005
822005
Morphological iterative closest point algorithm
CA Kapoutsis, CP Vavoulidis, I Pitas
Transactions on Image Processing 8 (11), 1644-1646, 1999
791999
Size complexity of two-way finite automata
CA Kapoutsis
International Conference on Developments in Language Theory, 47-66, 2009
472009
Two-way automata versus logarithmic space
CA Kapoutsis
International Computer Science Symposium in Russia, 359-372, 2011
442011
Size complexity of rotating and sweeping automata
CA Kapoutsis, R Královic, T Mömke
Journal of Computer and System Sciences 78 (2), 537-558, 2012
352012
Minicomplexity
C Kapoutsis
Journal of Automata, Languages and Combinatorics 17 (2--4), 205--224, 2012
332012
Minicomplexity
CA Kapoutsis
International Workshop on Descriptional Complexity of Formal Systems, 20-42, 2012
332012
Two-way automata characterizations of L/poly versus NL
CA Kapoutsis, G Pighizzini
International Computer Science Symposium in Russia, 217-228, 2012
302012
Two-Way Automata Versus Logarithmic Space
C Kapoutsis
Theory of Computing Systems 55 (2), 421-447, 2014
262014
Deterministic moles cannot solve liveness
CA Kapoutsis
Journal of Automata Languages and Combinatorics 12 (1/2), 215-235, 2007
252007
Deterministic moles cannot solve liveness
CA Kapoutsis
International Workshop on Descriptional Complexity of Formal Systems, 194-205, 2005
252005
Algorithms and lower bounds in finite automata size complexity
CA Kapoutsis
Massachusetts Institute of Technology, 2006
222006
Two-Way Automata Characterizations of L/poly Versus NL
C Kapoutsis, G Pighizzini
Theory of Computing Systems 56 (4), 662-685, 2015
212015
Small sweeping 2NFAs are not closed under complement
CA Kapoutsis
International Colloquium on Automata, Languages and Programming, 144-156, 2006
212006
Morphological techniques in the iterative closest point algorithm
CA Kapoutsis, CP Vavoulidis, I Pitas
International Conference on Image Processing, 808-812 (vol.1), 1998
181998
Nondeterminism is essential in small two-way finite automata with few reversals
CA Kapoutsis
Information and Computation 222, 208-227, 2013
172013
An exponential gap between LasVegas and deterministic sweeping finite automata
CA Kapoutsis, R Královič, T Mömke
International Symposium on Stochastic Algorithms: Foundations and …, 2007
112007
Alternation in two-way finite automata
C Kapoutsis, M Zakzok
Theoretical Computer Science 870, 75-102, 2021
92021
On the size complexity of rotating and sweeping automata
CA Kapoutsis, R Královič, T Mömke
International Conference on Developments in Language Theory, 455-466, 2008
82008
Complement for two-way alternating automata
V Geffert, CA Kapoutsis, M Zakzok
Acta Informatica 58 (5), 463-495, 2021
72021
系统目前无法执行此操作,请稍后再试。
文章 1–20