23 citations · 24 across the 3 of their papers we have counts for
3 papers
cs.FL2009★ 1 cited
Bounded Languages Meet Cellular Automata with Sparse Communication
Martin Kutrib, Andreas Malcher
Cellular automata are one-dimensional arrays of interconnected interacting finite automata. We investigate one of the weakest classes, the real-time one-way cellular automata, and…
cs.CC2009★ 23 cited
Multi-Head Finite Automata: Characterizations, Concepts and Open Problems
Markus Holzer, Martin Kutrib, Andreas Malcher
Multi-head finite automata were introduced in (Rabin, 1964) and (Rosenberg, 1966). Since that time, a vast literature on computational and descriptional complexity issues on multi-…
cs.FL2009
Descriptional complexity of bounded context-free languages
Andreas Malcher, Giovanni Pighizzini
Finite-turn pushdown automata (PDA) are investigated concerning their descriptional complexity. It is known that they accept exactly the class of ultralinear context-free languages…