Using string languages to describe picture languages
From MaRDI portal
Publication:3674078
DOI10.1016/S0019-9958(82)80020-XzbMath0523.68065OpenAlexW1986558002WikidataQ54310090 ScholiaQ54310090MaRDI QIDQ3674078
Hermann Maurer, Grzegorz Rozenberg, Ermo Welzl
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
Related Items (40)
Cancellation in context-free languages: enrichment by reduction ⋮ On regular drawn symbolic picture languages ⋮ Retreat bounded picture languages ⋮ Efficient reductions of picture words ⋮ Unambiguous description of chain code picture languages ⋮ The membership and equivalence problems for picture languages ⋮ Hilbert words as arrays generated with P systems ⋮ Inference of even linear grammars and its application to picture description languages ⋮ The finiteness of synchronous, tabled picture languages is decidable ⋮ P Systems with Parallel Rewriting for Chain Code Picture Languages ⋮ Star-free picture expressions are strictly weaker than first-order logic ⋮ A transformation system for generating description languages of chain code pictures ⋮ Shuffle on trajectories: Syntactic constraints ⋮ 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 ⋮ Graphs and designing ⋮ Unnamed Item ⋮ Learning picture sets from examples ⋮ Complexity and decidability for restricted classes of picture languages ⋮ Picture iteration and picture ambiguity ⋮ Theory as basis for advances in hypermedia ⋮ Generating self-affine fractals by collage grammars ⋮ Generating pictures in string representation with P systems: the case of space-filling curves ⋮ Division rules for tissue P systems inspired by space filling curves ⋮ Chain-code pictures and collages generated by hyperedge replacement ⋮ Decision problems and regular chain code picture languages ⋮ On reversal-bounded picture languages ⋮ Learning semilinear sets from examples and via queries ⋮ Picture words with invisible lines ⋮ Adding symbolic information to picture models: definitions and properties ⋮ Tree-based generation of languages of fractals ⋮ Two undecidability results for chain code picture languages ⋮ Perfectly quilted rectangular snake tilings ⋮ Satisfiability via Smooth Pictures ⋮ Leftmove-bounded picture languages ⋮ LINKS ⋮ Undecidability of existential properties in picture languages ⋮ Tree-based picture generation ⋮ Complexity and decidability for chain code picture languages ⋮ Decidability of the consistency problem for regular symbolic picture description languages
This page was built for publication: Using string languages to describe picture languages
