Lax Lean Archive

Recognition by a finite nondeterministic automaton

Lax146103.NFARecognizable · concepts/Lax146103/NFARecognizable.lean · lax-146103

definition

Loading review…

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Definition

    A language is NFA-recognizable when it is accepted by a mathlib nondeterministic automaton whose state type is finite.

    Concept map
    1 concept; 3 descendants hidden
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A

    Lean source view on GitHub

    1import Mathlib.Computability.NFA
    2
    3/-!
    4---
    5title: Recognition by a finite nondeterministic automaton
    6type: definition
    7---
    8
    9A language is NFA-recognizable when it is accepted by a mathlib
    10nondeterministic automaton whose state type is finite.
    11-/
    12
    13namespace Lax146103.NFARecognizable
    14
    15universe u
    16
    17/-- Recognition by an NFA with a finite state type. -/
    18def NFARecognizable {Sigma : Type u} (L : _root_.Language Sigma) : Prop :=
    19 ∃ Q : Type, ∃ _ : Fintype Q, ∃ M : NFA Sigma Q, M.accepts = L
    20
    21end Lax146103.NFARecognizable
    22
    Builds on

    none

    Used by
    From Mathlib

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…