Using string languages to describe picture languages
From MaRDI portal
Publication:3674078
DOI10.1016/S0019-9958(82)80020-XzbMATH Open0523.68065OpenAlexW1986558002WikidataQ54310090 ScholiaQ54310090MaRDI QIDQ3674078FDOQ3674078
Grzegorz Rozenberg, Emo Welzl, Hermann Maurer
Publication date: 1982
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(82)80020-x
Cited In (40)
- Division rules for tissue P systems inspired by space filling curves
- Generating pictures in string representation with P systems: the case of space-filling curves
- Learning picture sets from examples
- Title not available (Why is that?)
- Shuffle on trajectories: Syntactic constraints
- Learning semilinear sets from examples and via queries
- Inference of even linear grammars and its application to picture description languages
- Star-free picture expressions are strictly weaker than first-order logic
- Efficient reductions of picture words
- On regular drawn symbolic picture languages
- Adding symbolic information to picture models: definitions and properties
- A transformation system for generating description languages of chain code pictures
- Decision problems and regular chain code picture languages
- Two undecidability results for chain code picture languages
- The finiteness of synchronous, tabled picture languages is decidable
- Complexity and decidability for restricted classes of picture languages
- Picture iteration and picture ambiguity
- Complexity and decidability for chain code picture languages
- The membership and equivalence problems for picture languages
- On reversal-bounded picture languages
- Retreat bounded picture languages
- Tree-based generation of languages of fractals
- LINKS
- Perfectly quilted rectangular snake tilings
- Decidability of the consistency problem for regular symbolic picture description languages
- Chain-code pictures and collages generated by hyperedge replacement
- Undecidability of existential properties in picture languages
- Satisfiability via Smooth Pictures
- Cancellation in context-free languages: enrichment by reduction
- Tree-based picture generation
- Graphs and designing
- Theory as basis for advances in hypermedia
- P Systems with Parallel Rewriting for Chain Code Picture Languages
- Unambiguous description of chain code picture languages
- Hilbert words as arrays generated with P systems
- Picture words with invisible lines
- Leftmove-bounded picture languages
- Language generating alphabetic flat splicing P systems
- Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats
- Generating self-affine fractals by collage grammars
This page was built for publication: Using string languages to describe picture languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3674078)