Pages that link to "Item:Q2465040"

The following pages link to Enumeration and generation with a string automata representation (Q2465040):

Displayed 14 items.

• Generating, sampling and counting subclasses of regular tree languages (Q359886) ‎ (← links)
• Primitive digraphs with large exponents and slowly synchronizing automata (Q376118) ‎ (← links)
• Incomplete operational transition complexity of regular languages (Q498392) ‎ (← links)
• Empirical studies in the size of diagnosers and verifiers for diagnosability analysis (Q1686857) ‎ (← links)
• A hitchhiker's guide to descriptional complexity through analytic combinatorics (Q2437857) ‎ (← links)
• Random Deterministic Automata (Q2921998) ‎ (← links)
• On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism (Q2947416) ‎ (← links)
• Incremental DFA Minimisation (Q3073619) ‎ (← links)
• COMPAS - A Computing Package for Synchronization (Q3073624) ‎ (← links)
• A Challenging Family of Automata for Classical Minimization Algorithms (Q3073644) ‎ (← links)
• ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED (Q3395137) ‎ (← links)
• EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA (Q3526533) ‎ (← links)
• Short Regular Expressions from Finite Automata: Empirical Results (Q3637356) ‎ (← links)
• STATE COMPLEXITY AND APPROXIMATION (Q4902894) ‎ (← links)