dfa_prod
The direct product dfa_prod A₁ A₂ of two deterministic finite automata A₁ : DFA α σ₁ and A₂ : DFA α σ₂ over alphabet α is the DFA with state type σ₁ × σ₂, start state (A₁.start, A₂.start), transition function step (q₁, q₂) a = (A₁.step q₁ a, A₂.step q₂ a), and accepting states {p : σ₁ × σ₂ | p.1 ∈ A₁.accept ∧ p.2 ∈ A₂.accept}.
Statement
def dfa_prod {α σ₁ σ₂ : Type*} (A₁ : DFA α σ₁) (A₂ : DFA α σ₂) : DFA α (σ₁ × σ₂)
- Defined in
- arXiv:2611.09136 Section 2
- Verified
- 09 Nov 2026
- Axioms
- none listed
- Used by 18
- op_1291_extremal_reset_thresholds_characterizationOpen Problem OP-1291: For any synchronizable DFAs
A₁andA₂over a common alphabet, the direct product attains the lower bound… - dfa_prod_attains_upper_boundA pair of DFAs
A₁andA₂over the same alphabet attains the upper bound of Proposition 3.4 if the reset threshold of their direct… - dfa_prod_is_synchronizing_iffA word
wis synchronizing for the direct productdfa_prod A₁ A₂of two deterministic finite automata if and only ifwis… - dfa_prod_subset_sync_two_stage_boundFor any synchronizing word
w₁ofA₁, the reset threshold of the direct productdfa_prod A₁ A₂is at most the length ofw₁plus the… - dfa_prod_attains_lower_bound_of_subsingletonProposition 3.13 of arXiv:2611.09136: For any two DFAs
A₁andA₂over a subsingleton (unary) alphabet, their direct product always… - op_1293_intermediate_reset_thresholdOpen Problem OP-1293 (arXiv:2611.09136 Sec. 7, open question 2): For every finite alphabet α with at least two symbols, any positive…
- dfa_prod_is_synchronizing_appendIf
w₁is a synchronizing word forA₁andw₂is a synchronizing word forA₂, then the concatenated wordw₁ ++ w₂is a… - op_1292_optimality_of_two_stage_subset_sync_falseOpen Problem OP-1292 does not hold: it is not the case that for every pair of synchronizable DFAs
A₁andA₂over a shared finite… - op_1293_product_reset_threshold_lower_bound_attainedFor every nonempty finite alphabet α and positive integers k₁, k₂, there exist finite state types σ₁, σ₂ and synchronizable DFAs A₁ : DFA…
- op_1670_opposite_cerny_product_two_three_is_synchronizingThe binary word [false, true, true, false] synchronizes the direct product dfa_prod (cerny_dfa 2) (cerny_swap_dfa 3) of the 2-state Černý…
- dfa_prod_is_synchronizing_of_subset_synchronizingIf
w₁is a synchronizing word forA₁, andvis a subset-synchronizing word for the image set ofw₁onA₂, then the concatenated… - op_1293_product_reset_threshold_upper_bound_attainedFor every finite alphabet α with at least two symbols and positive integers k₁, k₂, there exist finite state types σ₁, σ₂ and…
- op_1670_opposite_cerny_product_reset_threshold_two_threeThe reset threshold of the direct product dfa_prod (cerny_dfa 2) (cerny_swap_dfa 3) of the 2-state Černý automaton and the 3-state…
- op_1293_intermediate_reset_threshold_k1_eq_one_k2_eq_oneFor every finite alphabet α with at least two symbols and k ∈ {1, 2}, there exist finite state types σ₁, σ₂ and synchronizable DFAs A₁ :…
- dfa_prod_reset_threshold_boundsFor any two deterministic finite automata
A₁andA₂over the same alphabet, the reset threshold of their direct product satisfies… - op_1667_opposite_cerny_product_two_is_synchronizingThe binary word [false, true] of length 2 synchronizes the direct product of the 2-state Černý automaton C_2 and its letter-swapped copy…
- op_1667_opposite_cerny_product_reset_threshold_twoThe reset threshold of the direct product of the 2-state Černý automaton C_2 and its letter-swapped copy C_2^swap is 2.
- dfa_prod_attains_lower_boundA pair of DFAs
A₁andA₂over the same alphabet attains the lower bound of Proposition 3.4 if the reset threshold of their direct…
- op_1291_extremal_reset_thresholds_characterizationOpen Problem OP-1291: For any synchronizable DFAs
Read back from the Lean
Definition of the product DFA dfa_prod A₁ A₂ for two DFAs A₁ : DFA α σ₁ and A₂ : DFA α σ₂ over the same alphabet type α: it is the DFA with state type σ₁ × σ₂ whose transition function maps ((q₁, q₂), a) to (A₁.step q₁ a, A₂.step q₂ a), whose start state is (A₁.start, A₂.start), and whose set of accepting states is { p : σ₁ × σ₂ | p.1 ∈ A₁.accept ∧ p.2 ∈ A₂.accept }.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The direct product of two DFAs over the same alphabet. -/ def dfa_prod {α σ₁ σ₂ : Type*} (A₁ : DFA α σ₁) (A₂ : DFA α σ₂) : DFA α (σ₁ × σ₂) where step := fun (q₁, q₂) a => (A₁.step q₁ a, A₂.step q₂ a) start := (A₁.start, A₂.start) accept := { p | p.1 ∈ A₁.accept ∧ p.2 ∈ A₂.accept }