Representing a P-complete problem by small trellis automata

Details Representing a P-complete problem by small trellis automata Representing a P-complete problem by small trellis automata

2009-06-17

arxiv.org/abs/0906.3208v1

EPTCS 1, 2009, pp. 185-198

Computer Science

Computational Complexity

Scientific paper

10.4204/EPTCS.1.18

A restricted case of the Circuit Value Problem known as the Sequential NOR Circuit Value Problem was recently used to obtain very succinct examples of conjunctive grammars, Boolean grammars and language equations representing P-complete languages (Okhotin, http://dx.doi.org/10.1007/978-3-540-74593-8_23 "A simple P-complete problem and its representations by language equations", MCU 2007). In this paper, a new encoding of the same problem is proposed, and a trellis automaton (one-way real-time cellular automaton) with 11 states solving this problem is constructed.

Affiliated with

Also associated with

No associations

Rating

Representing a P-complete problem by small trellis automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Representing a P-complete problem by small trellis automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Representing a P-complete problem by small trellis automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-223429