Pages that link to "Item:Q1058857"
From MaRDI portal
The following pages link to Complexity and decidability for chain code picture languages (Q1058857):
Displaying 17 items.
- Adding symbolic information to picture models: definitions and properties (Q557811) (← links)
- Valuations of languages, with applications to fractal geometry (Q674334) (← links)
- Decision problems and regular chain code picture languages (Q686522) (← links)
- On the connectedness of pictures in chain code picture languages (Q808270) (← 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)
- The membership and equivalence problems for picture languages (Q1098327) (← links)
- A transformation system for generating description languages of chain code pictures (Q1124358) (← links)
- On reversal-bounded picture languages (Q1200803) (← 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)
- Decidability of the consistency problem for regular symbolic picture description languages (Q1603368) (← links)
- On regular drawn symbolic picture languages (Q1877551) (← links)
- Efficient reductions of picture words (Q5286054) (← links)
