Whether the automaton is cycle ambiguous. It means that there exist a state $s$ and a label $x$ such that there is more than one cycle in $s$ labeled with $x$.
Preconditions:
import vcsn
a = vcsn.automaton('''digraph
{
vcsn_context = "lal_char(ab), b"
I0 -> 0
0 -> F0
0 -> 1 [label = "a"]
0 -> 2 [label = "a"]
1 -> 0 [label = "b"]
2 -> 0 [label = "b"]
}''')
a
At state $0$, the automaton has two cycles "ab" so it is cycle ambiguous.
a.is_cycle_ambiguous()
a = vcsn.automaton('''digraph
{
vcsn_context = "lal_char(abc), b"
I0 -> 0
0 -> F0
0 -> 1 [label = "a"]
0 -> 2 [label = "a"]
1 -> 0 [label = "b"]
2 -> 0 [label = "c"]
}''')
a
At state $0$, the automaton has two cycles with different label "ab", "ac" so it is not cycle ambiguous (it is cycle-unambiguous).
a.is_cycle_ambiguous()
a = vcsn.context("lal_char(abc), b").ladybird(3)
a
Two cycles in $0$ with label "acac".
a.is_cycle_ambiguous()
a = vcsn.automaton('''digraph {
vcsn_context = "lal_char(abc), b"
I0 -> 0
0 -> F0
0 -> 1 [label = "a"]
0 -> 2 [label = "a"]
1 -> 0 [label = "b"]
1 -> 3 [label = "b"]
2 -> 1 [label = "c"]
2 -> 2 [label = "b"]
3 -> 1 [label = "c"]
}''')
a
Two cycles in $0$ with label "babc".
a.is_cycle_ambiguous()
a = vcsn.automaton('''digraph {
vcsn_context = "lal_char(ab), b"
I0 -> 0
0 -> F0
1 -> 2 [label = "a"]
1 -> 3 [label = "a"]
2 -> 1 [label = "b"]
3 -> 1 [label = "b"]
}''')
a
a.is_cycle_ambiguous()