Pages that link to "Item:Q5200060"

The following pages link to Chrobak Normal Form Revisited, with Applications (Q5200060):

Displaying 9 items.

• Approximate membership for regular languages modulo the edit distance (Q387000) (← links)
• Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (Q388216) (← links)
• Enhancing unsatisfiable cores for LTL with information on temporal relevance (Q507378) (← links)
• Automata for unordered trees (Q515668) (← links)
• Optimal state reductions of automata with partially specified behaviors (Q728283) (← links)
• Operational state complexity of unary NFAs with finite nondeterminism (Q896686) (← links)
• String theories involving regular membership predicates: from practice to theory and back (Q2140459) (← links)
• Nondeterministic syntactic complexity (Q2233426) (← links)
• Towards more efficient methods for solving regular-expression heavy string constraints (Q2680985) (← links)