AFTD Auto-Formalizing Theoretical Domains

Cslib.Automata.DA

structureimported Lean

A deterministic automaton extends a FLTS with a unique initial state.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open List Filter in
structure Cslib.Automata.DA (State Symbol : Type*) extends FLTS State Symbol
Defined in
CSLib, `Cslib.Automata.DA`
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.
Verified
08 Oct 2026
Axioms
none listed
Built on 1
  • 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 7

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open List Filter in
/-- A deterministic automaton extends a `FLTS` with a unique initial state. -/
structure Cslib.Automata.DA (State Symbol : Type*) extends FLTS State Symbol where
  /-- The initial state of the automaton. -/
  start : State
See it in the graphDiscuss this resultChallenge it