Cslib.Automata.NA.Buchi.interAcc
defimported Lean
The two accepting conditions of the intersection automaton.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Set Prod Filter in variable {Symbol : Type*} {State : Bool → Type*} in @[scoped grind =] def Cslib.Automata.NA.Buchi.interAcc (j : Bool) (acc : (i : Bool) → Set (State i)) : Set ((Π i, State i) × Bool)
- Defined in
- CSLib, `Cslib.Automata.NA.Buchi.interAcc`
- 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.Buchi.interAcc← Cslib.Automata.NA.Buchi.interAcc (Cslib/Computability/Automata/NA/BuchiInter.lean:40): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 2
- Cslib.Automata.NA.Buchi.interAcceptThe overall accepting condition of the intersection automaton.
- Cslib.Automata.NA.Buchi.histTransThe transition function of the history state.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Set Prod Filter in variable {Symbol : Type*} {State : Bool → Type*} in /-- The two accepting conditions of the intersection automaton. -/ @[scoped grind =] def Cslib.Automata.NA.Buchi.interAcc (j : Bool) (acc : (i : Bool) → Set (State i)) : Set ((Π i, State i) × Bool) := { (s, h) | s j ∈ acc j ∧ h = j }