Alexander Okhotin. Representing a P-complete problem by small trellis automata. In Turlough Neary, Damien Woods, Anthony Karel Seda, Niall Murphy, editors, Complexity of Simple Programs 2008, CSP 2008, Cork, Ireland, December 6-7, 2008. Proceedings. pages 243-258, Cork University Press, 2008.
Abstract is missing.