Canonical decomposition of catenation of factorial languages

Simple item page
dc.creatorFrid, A.
dc.date2006-10-26
dc.date2007-01-31
dc.date.accessioned2026-07-07T07:43:50Z
dc.date.available2026-07-07T07:43:50Z
dc.descriptionAccording to a previous result by S. V. Avgustinovich and the author, each factorial language admits a unique canonical decomposition to a catenation of factorial languages. In this paper, we analyze the appearance of the canonical decomposition of a catenation of two factorial languages whose canonical decompositions are given.
dc.descriptionSubmitted
dc.identifierhttps://arxiv.org/abs/cs/0610149
dc.identifierhttp://arxiv.org/abs/cs/0610149
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/122979
dc.subjectLogic in Computer Science
dc.titleCanonical decomposition of catenation of factorial languages
dc.typetext

Files

Collections

arXiv