Pages that link to "Item:Q3674078"
From MaRDI portal
The following pages link to Using string languages to describe picture languages (Q3674078):
Displayed 40 items.
- Adding symbolic information to picture models: definitions and properties (Q557811) (← links)
- Generating self-affine fractals by collage grammars (Q673096) (← links)
- Decision problems and regular chain code picture languages (Q686522) (← links)
- The finiteness of synchronous, tabled picture languages is decidable (Q860893) (← links)
- Complexity and decidability for restricted classes of picture languages (Q909482) (← links)
- Picture iteration and picture ambiguity (Q909483) (← links)
- Perfectly quilted rectangular snake tilings (Q1013125) (← links)
- Complexity and decidability for chain code picture languages (Q1058857) (← links)
- The membership and equivalence problems for picture languages (Q1098327) (← links)
- Inference of even linear grammars and its application to picture description languages (Q1108045) (← links)
- A transformation system for generating description languages of chain code pictures (Q1124358) (← links)
- Shuffle on trajectories: Syntactic constraints (Q1128661) (← links)
- On reversal-bounded picture languages (Q1200803) (← links)
- Learning semilinear sets from examples and via queries (Q1200804) (← links)
- Picture words with invisible lines (Q1208724) (← links)
- Cancellation in context-free languages: enrichment by reduction (Q1325840) (← links)
- Retreat bounded picture languages (Q1334657) (← links)
- Unambiguous description of chain code picture languages (Q1350202) (← links)
- Leftmove-bounded picture languages (Q1566721) (← links)
- Undecidability of existential properties in picture languages (Q1575948) (← links)
- Tree-based picture generation (Q1583092) (← links)
- Decidability of the consistency problem for regular symbolic picture description languages (Q1603368) (← links)
- On regular drawn symbolic picture languages (Q1877551) (← links)
- Generating pictures in string representation with P systems: the case of space-filling curves (Q1982992) (← links)
- Division rules for tissue P systems inspired by space filling curves (Q1983011) (← links)
- Hilbert words as arrays generated with P systems (Q2152295) (← links)
- Language generating alphabetic flat splicing P systems (Q2413312) (← links)
- Satisfiability via Smooth Pictures (Q2817998) (← links)
- P Systems with Parallel Rewriting for Chain Code Picture Languages (Q3195691) (← links)
- LINKS (Q3401465) (← links)
- Theory as basis for advances in hypermedia (Q4365007) (← links)
- Star-free picture expressions are strictly weaker than first-order logic (Q4571966) (← links)
- Chain-code pictures and collages generated by hyperedge replacement (Q4645291) (← links)
- Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats (Q5096149) (← links)
- Graphs and designing (Q5096282) (← links)
- Efficient reductions of picture words (Q5286054) (← links)
- (Q5867524) (← links)
- Tree-based generation of languages of fractals (Q5958129) (← links)
- Two undecidability results for chain code picture languages (Q5958344) (← links)
- Learning picture sets from examples (Q6142870) (← links)