Word-graph theory : on the structural characterisation of word-respectable digraphs
A word- graph Gw is a simple digraph associated with a finite word w such that the vertex set of Gw is the alphabet of wand the edge-set of Gw is determined by ~on-identical adjacent letter pairs in w. A family of word-graphs can be thought of as a formal language. The novel theory of word- graphs p...
Main Author: | |
---|---|
Published: |
Lancaster University
2012
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.660112 |