Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata

@article{Modanese2020SublinearTimeLR,
  title={Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata},
  author={Augusto Modanese},
  journal={Developments in Language Theory},
  year={2020},
  volume={12086},
  pages={251 - 265}
}
  • Augusto Modanese
  • Published 2020
  • Computer Science, Mathematics
  • Developments in Language Theory
  • After an apparent hiatus of roughly 30 years, we revisit a seemingly neglected subject in the theory of (one-dimensional) cellular automata: sublinear-time computation. The model considered is that of ACAs, which are language acceptors whose acceptance condition depends on the states of all cells in the automaton. We prove a time hierarchy theorem for sublinear-time ACA classes, analyze their intersection with the regular languages, and, finally, establish strict inclusions in the parallel… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 38 REFERENCES

    A Taxonomy of Problems with Fast Parallel Algorithms

    Algebraic decision procedures for local testability

    VIEW 1 EXCERPT

    Automata, languages, and machines. A

    Brzozowski and Imre Simon . “ Characterizations of locally testable events . ”

    • A Janusz
    • In : Discrete Mathematics
    • 1973

    Cellular Automata and Language Theory

    • Martin Kutrib
    • Computer Science
    • Encyclopedia of Complexity and Systems Science
    • 2009
    VIEW 1 EXCERPT