Pages that link to "Item:Q5537394"

The following pages link to Lower Bound of the Number of Threshold Functions (Q5537394):

Displaying 11 items.

• On the acceptance power of regular languages (Q672323) (← links)
• Linear function neurons: Structure and training (Q1070193) (← links)
• Optimal estimation on the order of local testability of finite automata (Q1575894) (← links)
• Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order (Q1978707) (← links)
• Determination of finite automata accepting subregular languages (Q2271457) (← links)
• A sufficient condition to polynomially compute a minimum separating DFA (Q2282132) (← links)
• Locally testable languages (Q2554236) (← links)
• Characterizations of locally testable events (Q2558849) (← links)
• Number of labelings of definite automata graphs (Q2674670) (← links)
• Aspects of Reversibility for Classical Automata (Q2944881) (← links)
• (Q5576262) (← links)