Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure

Details Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure

2007-03-15

arxiv.org/abs/cs/0703079v2

LMCS 3 (2:3) 2007

Computer Science

Logic in Computer Science

Paper for Logical Methods in Computer Science, 27 pages, 1 figure

Scientific paper

10.2168/LMCS-3(2:3)2007

String languages recognizable in (deterministic) log-space are characterized either by two-way (deterministic) multi-head automata, or following Immerman, by first-order logic with (deterministic) transitive closure. Here we elaborate this result, and match the number of heads to the arity of the transitive closure. More precisely, first-order logic with k-ary deterministic transitive closure has the same power as deterministic automata walking on their input with k heads, additionally using a finite set of nested pebbles. This result is valid for strings, ordered trees, and in general for families of graphs having a fixed automaton that can be used to traverse the nodes of each of the graphs in the family. Other examples of such families are grids, toruses, and rectangular mazes. For nondeterministic automata, the logic is restricted to positive occurrences of transitive closure. The special case of k=1 for trees, shows that single-head deterministic tree-walking automata with nested pebbles are characterized by first-order logic with unary deterministic transitive closure. This refines our earlier result that placed these automata between first-order and monadic second-order logic on trees.

Affiliated with

Also associated with

No associations

Rating

Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure 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 Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-363611