23 citations · 24 across the 3 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
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.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…