Cslib.Automata.DA.prod
defimported Lean
The product of two deterministic automata.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open List in open scoped Cslib.FLTS in variable {State1 State2 Symbol : Type*} in @[scoped grind =] def Cslib.Automata.DA.prod (da1 : DA State1 Symbol) (da2 : DA State2 Symbol) : DA (State1 × State2) Symbol
- Defined in
- CSLib, `Cslib.Automata.DA.prod`
- Lean proof
- By Fabrizio Montesi, Ching-Tsun Chou, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2025 Fabrizio Montesi. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.Cslib.Automata.DA.prod← Cslib.Automata.DA.prod (Cslib/Computability/Automata/DA/Prod.lean:27): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- Cslib.FLTS.prodThe product of two FLTS with the same label type.
- Cslib.Automata.DAA deterministic automaton extends a
FLTSwith a unique initial state. - Cslib.FLTSA Functional Labelled Transition System (
FLTS) for a type of states (State) and a type of transition labels (Label) consists of a…
- Used by 1
- Cslib.Automata.DA.prod_mtr_eqA state is reachable by the product automaton iff its components are reachable by the respective automaton components.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open List in open scoped Cslib.FLTS in variable {State1 State2 Symbol : Type*} in /-- The product of two deterministic automata. -/ @[scoped grind =] def Cslib.Automata.DA.prod (da1 : DA State1 Symbol) (da2 : DA State2 Symbol) : DA (State1 × State2) Symbol where toFLTS := da1.toFLTS.prod da2.toFLTS start := (da1.start, da2.start)