Pages that link to "Item:Q868946"

The following pages link to Obtaining shorter regular expressions from finite-state automata (Q868946):

Displaying 10 items.

• Acyclic automata and small expressions using multi-tilde-bar operators (Q1959650) (← links)
• From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (Q2800411) (← links)
• Provably Shorter Regular Expressions from Deterministic Finite Automata (Q3533026) (← links)
• Multi-tilde Operators and Their Glushkov Automata (Q3618589) (← links)
• Implementation of State Elimination Using Heuristics (Q3637355) (← links)
• Short Regular Expressions from Finite Automata: Empirical Results (Q3637356) (← links)
• Small Extended Expressions for Acyclic Automata (Q3637357) (← links)
• PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA (Q5168416) (← links)
• Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey (Q5175773) (← links)
• Optimal Lower Bounds on Regular Expression Size Using Communication Complexity (Q5458365) (← links)