Pages that link to "Item:Q5048931"

The following pages link to Regular expressions and context-free grammars for picture languages (Q5048931):

Displaying 13 items.

• A unifying approach to picture grammars (Q719247) (← links)
• Axiomatizing the identities of binoid languages (Q870834) (← links)
• Non-recursive trade-offs between two-dimensional automata and grammars (Q896688) (← links)
• Deterministic and unambiguous two-dimensional languages over one-letter alphabet (Q1013124) (← links)
• Characterizations of recognizable picture series (Q1022605) (← links)
• A characterization of recognizable picture languages by tilings by finite sets (Q1292300) (← links)
• Two-dimensional models (Q2074211) (← links)
• Undecidability of the emptiness problem for context-free picture languages (Q2357111) (← links)
• A CKY parser for picture grammars (Q2380077) (← links)
• Tile rewriting grammars and picture languages (Q2484438) (← links)
• New operations and regular expressions for two-dimensional languages over one-letter alphabet (Q2484449) (← links)
• Picture languages: tiling systems versus tile rewriting grammars. (Q2490811) (← links)
• (Un)decidability of the Emptiness Problem for Multi-dimensional Context-Free Grammars (Q2947427) (← links)