Pages that link to "Item:Q2465048"

The following pages link to On the average state and transition complexity of finite languages (Q2465048):

Displaying 13 items.

• Lower bounds for the transition complexity of NFAs (Q955341) (← links)
• Descriptional complexity of regular languages (Q2074214) (← links)
• VC-dimensions of nondeterministic finite automata for words of equal length (Q2075374) (← links)
• More on deterministic and nondeterministic finite cover automata (Q2357103) (← links)
• State complexity of permutation on finite languages over a binary alphabet (Q2358683) (← links)
• A hitchhiker's guide to descriptional complexity through analytic combinatorics (Q2437857) (← links)
• More on Deterministic and Nondeterministic Finite Cover Automata (Q2947414) (← links)
• NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
• Separating the Classes of Recursively Enumerable Languages Based on Machine Size (Q3455749) (← links)
• ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA (Q3538856) (← links)
• THE AVERAGE STATE COMPLEXITY OF RATIONAL OPERATIONS ON FINITE LANGUAGES (Q3586401) (← links)
• Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
• STATE COMPLEXITY AND APPROXIMATION (Q4902894) (← links)