Parallel language recognition in constant time by cellular automata

@article{Sommerhalder1983ParallelLR,
  title={Parallel language recognition in constant time by cellular automata},
  author={Rudolph Sommerhalder and S. Christian van Westrhenen},
  journal={Acta Informatica},
  year={1983},
  volume={19},
  pages={397-407}
}
It is proved that the set of all languages accepted within a fixed, language dependent number of steps by deterministic one dimensional cellular acceptors is a proper subset of the set of all regular languages. A combinatorial condition is stated which is necessary and sufficient for a language to be recognizable in constant time by a deterministic one dimensional cellular automaton. It is shown that the question of whether or not the language generated by a given context-sensitive grammar is… CONTINUE READING