Commit b3c8c9e9 authored by Hans-Peter Deifel's avatar Hans-Peter Deifel 🐢

Add another tree automaton example

parent 27bfccba
# This is an example from [1], used to distinguish the expressivity of
# deterministic and non-deterministic top down tree automata.
#
# The automaton below accepts the tree language
#
# T = { f(a, b), f(b, a) }
#
# with symbols a/0, b/0 and f/2. A deterministic top-down automaton would not
# accept that language. See [1, Proposition 1.6.2].
{init, non_init} x Ƥ({a,b} + {f}×X×X)
q_i: (init, { inj1 (f, q_a, q_b), inj1 (f, q_b, q_a) })
q_a: (non_init, { inj0 a })
q_b: (non_init, { inj0 b })
# [1]: Comon, Hubert; Dauchet, Max; Gilleron, Rémi; Jacquemard, Florent;
# Lugiez, Denis; Löding, Christof; Tison, Sophie; Tommasi, Marc
# (November 2008).
# Tree Automata Techniques and Applications.
# Retrieved 2019-03-15.
Block 0: q_i
Block 1: q_a
Block 2: q_b
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment