AFTD Auto-Formalizing Theoretical Domains

Cslib.Automata.Acceptor

classimported Lean

An Acceptor is a machine that recognises strings (lists of symbols in an alphabet).

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
class Cslib.Automata.Acceptor (A : Type u) (Symbol : outParam (Type v))
Defined in
CSLib, `Cslib.Automata.Acceptor`
Lean proof
By Fabrizio Montesi, 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
Used by 4

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
/-- An `Acceptor` is a machine that recognises strings (lists of symbols in an alphabet). -/
class Cslib.Automata.Acceptor (A : Type u) (Symbol : outParam (Type v)) where
  /-- Predicate that establishes whether a string `xs` is accepted. -/
  Accepts (a : A) (xs : List Symbol) : Prop
See it in the graphDiscuss this resultChallenge it