automaton
& aut
The (accessible part of the) "conjunction" of automata.
Also Known As:
synchronized product
Hadamard product
intersection
Preconditions:
all the labelsets are letterized
See also:
Examples
Boolean Automata
The synchronized product of Boolean automata computes the intersection of their languages. For instance, the conjunction of an automaton that accepts only words on with an odd number of with an automaton accepting with words with an odd number of :
is an automaton that accepts only words with odd numbers of and :
Weighted automata
Associativity
This operator is associative, and it is actually implemented as a variadic operator; a & b & c
is not exactly the same as (a&b)&c
: they are the same automata, but the former is labeled with 3-uples, not 2-uples.
The __value__
call here is an internal detail used to force Vcsn into the binary call. You should forget about it