Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 4003548

From MaRDI portal
Jump to:navigation, search

zbMATH Open0618.68063MaRDI QIDQ4728262FDOQ4728262


Authors: Marek Chrobak, Wojciech Rytter Edit this on Wikidata


Publication date: 1986



Title of this publication is not available (Why is that?)



Recommendations

  • scientific article; zbMATH DE number 4033664
  • On the decidability of some problems about rational subsets of free partially commutative monoids
  • scientific article; zbMATH DE number 3883641
  • Rewriting systems and word problems in a free partially commutative monoid
  • Unique decipherability in formal languages


zbMATH Keywords

complexitypartially commutative alphabetunique decipherability problemcommutativity relation graph


Mathematics Subject Classification ID

Formal languages and automata (68Q45)



Cited In (7)

  • The monoid of queue actions
  • Unique decipherability in formal languages
  • Unique decipherability in the monoid of languages: an application of rational relations
  • Unique Decipherability in the Monoid of Languages: An Application of Rational Relations
  • Title not available (Why is that?)
  • Rational, recognizable, and aperiodic partially lossy queue languages
  • On the decidability of some problems about rational subsets of free partially commutative monoids





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4728262)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4728262&oldid=18978060"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 21:20. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki