Source-pinned research

Research proof index

Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.

This index contains 2 research declarations. Search 10,000 more complete Mathlib declarations.

1 topic

2 results

Clear filters
Project-declaredLean 4.24.0-rc1

Buchi congr ample

Automata.buchi_congr_ample

Project documentation

The BuchiCongr of an NA is ample if the NA is finite-state. For simplicity, this result is proved using a Ramsey theorem on infinite graphs.

automata theoryformal languagescomputer science

Source project: Automata Theory

Person-level attribution pending.

View proof record
Project-declaredLean 4.24.0-rc1

Buchi congr saturates

Automata.buchi_congr_saturates

Plain-language statement

The BuchiCongr of an NA saturates the ω-language accepted by the NA. Note that this result does not need to assume that the NA is finite-state.

automata theoryformal languagescomputer science

Source project: Automata Theory

Person-level attribution pending.

View proof record