Knext

Query Results: Finite.a (page 70)

4,298 results in the active KB.

A finite automata can be discrete.
Logical form
Learned from
5 sentences.
A partition can be finite.
Logical form
Learned from
5 sentences.
A (degree field extension) can be finite.
Logical form
Learned from
5 sentences.
A genus can be finite.
Logical form
Learned from
5 sentences.
A (cross section) can be finite.
Logical form
Learned from
5 sentences.
A (verb phrase) can be finite.
Logical form
Learned from
5 sentences.
(Root systems) can be finite.
Logical form
Learned from
5 sentences.
(Difference code) can be finite.
Logical form
Learned from
5 sentences.
A finite set can be constituted-of-or-filled-with size.
Logical form
Learned from
5 sentences.
Iterations can be finite.
Logical form
Learned from
5 sentences.
Topologies can be on a finite set.
Logical form
Learned from
5 sentences.
An element can be a finite form of dal.
Logical form
Learned from
5 sentences.
An element can be a finite form of tind.
Logical form
Learned from
5 sentences.
Figures can be finite.
Logical form
Learned from
5 sentences.
A (vertex figure) can be finite.
Logical form
Learned from
5 sentences.

Search

Results returned on 2026-07-04.