Pages that link to "Item:Q1083220"

The following pages link to NTS languages are deterministic and congruential (Q1083220):

Displaying 22 items.

• Groups and NTS languages (Q580992) (← links)
• Toward a theory of input-driven locally parsable languages (Q728273) (← links)
• Some decision problems about controlled rewriting systems (Q910246) (← links)
• About the descriptive power of certain classes of finite string-rewriting systems (Q910850) (← links)
• The equivalence and inclusion problems for NTS languages (Q1083219) (← links)
• Thue systems as rewriting systems (Q1099642) (← links)
• Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages (Q1120292) (← links)
• A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336) (← links)
• The pre-NTS property is undecidable for context-free grammars (Q1208437) (← links)
• A formal specification of document processing (Q1370522) (← links)
• McNaughton families of languages. (Q1401181) (← links)
• The inclusion problem for some subclasses of context-free languages (Q1978515) (← links)
• Learning deterministic context free grammars: the Omphalos competition (Q2384127) (← links)
• Locally Chain-Parsable Languages (Q2946332) (← links)
• Distributional Learning of Context-Free and Multiple Context-Free Grammars (Q2963597) (← links)
• Time-bounded controlled bidirectional grammars (Q3477981) (← links)
• Identification in the Limit of k,l-Substitutable Context-Free Languages (Q3528426) (← links)
• On the generating power of regularly controlled bidirectional grammars (Q3979697) (← links)
• The equivalence of pre-NTS grammars is decidable (Q3992022) (← links)
• A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q5055831) (← links)
• Probabilistic learnability of context-free grammars with basic distributional properties from positive examples (Q5964066) (← links)
• Synchronizing deterministic push-down automata can be really hard (Q6186317) (← links)