Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the connectedness of pictures in chain code picture languages

From MaRDI portal
Publication:808270
Jump to:navigation, search

DOI10.1016/0304-3975(91)90196-9zbMath0731.68064OpenAlexW2025316351MaRDI QIDQ808270

Juergen Dassow

Publication date: 1991

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90196-9


zbMATH Keywords

code picture languagelinear grammars


Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)


Related Items (3)

Retreat bounded picture languages ⋮ Decision problems and regular chain code picture languages ⋮ LINKS




Cites Work

  • Complexity and decidability for chain code picture languages
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: On the connectedness of pictures in chain code picture languages

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:808270&oldid=12746154"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 11:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki