Cslib.Automata.NA.iProd
defimported Lean
The product of an indexed family of nondeterministic automata.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Set List in variable {Symbol I : Type*} {State : I → Type*} in @[scoped grind =] def Cslib.Automata.NA.iProd (na : (i : I) → NA (State i) Symbol) : NA (Π i, State i) Symbol
- Defined in
- CSLib, `Cslib.Automata.NA.iProd`
- Lean proof
- By Ching-Tsun Chou, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2025 Ching-Tsun Chou. 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.NA.iProd← Cslib.Automata.NA.iProd (Cslib/Computability/Automata/NA/Prod.lean:24): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- Cslib.Automata.NAA nondeterministic automaton extends a
LTSwith a set of initial states. - Cslib.LTSA Labelled Transition System (LTS) for a type of states (
State) and a type of transition labels (Label) consists of a labelled…
- Cslib.Automata.NAA nondeterministic automaton extends a
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Set List in variable {Symbol I : Type*} {State : I → Type*} in /-- The product of an indexed family of nondeterministic automata. -/ @[scoped grind =] def Cslib.Automata.NA.iProd (na : (i : I) → NA (State i) Symbol) : NA (Π i, State i) Symbol where Tr s x t := ∀ i, (na i).Tr (s i) x (t i) start := ⋂ i, (· i) ⁻¹' (na i).start