Google Groups Home
Help | Sign in
misc.test
+ new post
About this group
Subscribe to this group
This is a Usenet group - learn more
Computing Huffman codes on a Turing Machine (Fragments of waw log file)
Options
There are currently too many topics in this group that display first. To make this topic appear first, remove this option from another topic.
There was an error processing your request. Please try again.
flag
   2 messages - Collapse all
The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
Alex Vinokur  
View profile
  More options Jun 30 2004, 9:06 am
Newsgroups: misc.test
From: "Alex Vinokur" <ale...@bigfoot.com>
Date: 30 Jun 2004 06:06:55 -0700
Local: Wed, Jun 30 2004 9:06 am
Subject: Computing Huffman codes on a Turing Machine (Fragments of waw log file)
Reply to author | Forward | Print | Individual message | Show original | Report this message | Find messages by this author
Fragments of Raw log file

#=================================================
# Nondeterministic Turing Machine (C++ Simulator)
#   http://sourceforge.net/projects/turing-machine
#   Version 2.2
#   -----------
#   Alex Vinokur
#   http://up.to/alexvn
#   ale...@connect.to
#-------------------------------------------------
# CYGWIN
# GNU gcc version 3.3.1
#-------------------------------------------------
# START
# Wed Jun 30 14:51:36 2004
#=================================================

%%===========================================
%%=== Nondeterministic Turing Machine# 1 ====
%%======= Machine Definition : BEGIN ========
%%===========================================

###### Nondeterministic Turing Machine Definition ######
###### This Machine is actually Deterministic!!!  ######

====== Description ======
Computing Huffman codes on a Turing Machine

====== States Definition ======
Initial states  : q0
Halting states  : qf
Internal states : q01 qhcode qstep0 qstep1 qstep2 qm11 qm12 qm13 qm14
qm21
qme21 qm21d qm2e qm2e1 qm2e2 qm2e3 qm2e4 qm2s1 qm2s2
qm2s3
qm2s4 qmg1 qme1 qme2s1 qme2s2 qmer qmel1 qmel2 qmel3
qmel4
qmel5 qmine qsorte1 qsorte2 qrew10 qrew11 qrew12
qrew20
qrew22 qcp11 qcp1dig qcp1z qcp21 qcp2dig qcp2z qcp31
qeclen2

====== Alphabet Definition ======
------ Tape# 0 ------
Empty symbols alphabet : b
Input alphabet         : a *
Internal alphabet      : x c d 1 0

------ Tape# 1 ------
Empty symbols alphabet : b
Input alphabet         : a *
Internal alphabet      : x c d 1 0

------ Tape# 2 ------
Empty symbols alphabet : b
Input alphabet         : a *
Internal alphabet      : x c d 1 0

====== Transition Rules Definition ======
Rule#   0 :        q0 [ a b b ] --->      q0 [ (a, L) (b, L) (b, L) ]
Rule#   1 :        q0 [ b b b ] --->     q01 [ (x, R) (x, R) (x, R) ]
Rule#   2 :       q01 [ * b b ] --->     q01 [ (*, R) (b, N) (b, N) ]
Rule#   3 :       q01 [ 0 b b ] --->     q01 [ (0, R) (b, N) (b, N) ]
Rule#   4 :       q01 [ 1 b b ] --->     q01 [ (1, R) (b, N) (b, N) ]
Rule#   5 :       q01 [ a b b ] --->    qm11 [ (a, N) (b, N) (b, N) ]
Rule#   6 :       q01 [ b b b ] ---> qsorte1 [ (b, N) (b, L) (b, N) ]
Rule#   7 :       q01 [ d b b ] --->     q01 [ (d, R) (b, N) (b, N) ]
Rule#   8 :     qcp11 [ b x * ] --->   qcp1z [ (0, R) (x, N) (*, N) ]
Rule#   9 :     qcp11 [ b x 0 ] ---> qcp1dig [ (0, R) (x, N) (0, R) ]
Rule#  10 :     qcp11 [ b x 1 ] ---> qcp1dig [ (1, R) (x, N) (1, R) ]
Rule#  11 :     qcp11 [ b x a ] --->   qcp11 [ (a, R) (x, N) (a, R) ]
Rule#  12 :   qcp1dig [ b x * ] --->   qcp1z [ (0, R) (x, N) (*, N) ]
Rule#  13 :   qcp1dig [ b x 0 ] ---> qcp1dig [ (0, R) (x, N) (0, R) ]
Rule#  14 :   qcp1dig [ b x 1 ] ---> qcp1dig [ (1, R) (x, N) (1, R) ]
Rule#  15 :   qcp1dig [ b x a ] --->   qcp11 [ (0, R) (x, N) (a, N) ]
Rule#  16 :     qcp1z [ b x * ] --->   qcp21 [ (b, N) (x, N) (*, R) ]
Rule#  17 :     qcp21 [ b x * ] --->   qcp2z [ (1, R) (x, N) (*, N) ]
Rule#  18 :     qcp21 [ b x 0 ] ---> qcp2dig [ (0, R) (x, N) (0, R) ]
Rule#  19 :     qcp21 [ b x 1 ] ---> qcp2dig [ (1, R) (x, N) (1, R) ]
Rule#  20 :     qcp21 [ b x a ] --->   qcp21 [ (a, R) (x, N) (a, R) ]
Rule#  21 :     qcp21 [ b x b ] --->  qrew20 [ (1, R) (x, N) (b, N) ]
Rule#  22 :   qcp2dig [ b x * ] --->   qcp2z [ (1, R) (x, N) (*, N) ]
Rule#  23 :   qcp2dig [ b x 0 ] ---> qcp2dig [ (0, R) (x, N) (0, R) ]
Rule#  24 :   qcp2dig [ b x 1 ] ---> qcp2dig [ (1, R) (x, N) (1, R) ]
Rule#  25 :   qcp2dig [ b x a ] --->   qcp21 [ (1, R) (x, N) (a, N) ]
Rule#  26 :   qcp2dig [ b x b ] ---> qeclen2 [ (1, N) (x, N) (*, N) ]
Rule#  27 :     qcp2z [ b x * ] --->   qcp31 [ (*, R) (x, N) (*, R) ]
Rule#  28 :     qcp31 [ b x * ] --->   qcp31 [ (*, R) (x, N) (*, R) ]
Rule#  29 :     qcp31 [ b x 0 ] --->   qcp31 [ (0, R) (x, N) (0, R) ]
Rule#  30 :     qcp31 [ b x 1 ] --->   qcp31 [ (1, R) (x, N) (1, R) ]
Rule#  31 :     qcp31 [ b x a ] --->   qcp31 [ (a, R) (x, N) (a, R) ]
Rule#  32 :     qcp31 [ b x b ] --->  qrew20 [ (b, N) (x, N) (b, N) ]
Rule#  33 :   qeclen2 [ 0 x * ] ---> qeclen2 [ (1, N) (x, N) (b, L) ]
Rule#  34 :   qeclen2 [ 0 x 0 ] ---> qeclen2 [ (1, N) (x, N) (b, L) ]
Rule#  35 :   qeclen2 [ 0 x 1 ] ---> qeclen2 [ (1, N) (x, N) (b, L) ]
Rule#  36 :   qeclen2 [ 0 x a ] ---> qeclen2 [ (1, N) (x, N) (b, L) ]
Rule#  37 :   qeclen2 [ 0 x x ] --->  qhcode [ (1, N) (x, R) (x, N) ]
Rule#  38 :   qeclen2 [ 1 x * ] ---> qeclen2 [ (1, N) (x, N) (b, L) ]
Rule#  39 :   qeclen2 [ 1 x 0 ] ---> qeclen2 [ (1, N) (x, N) (b, L) ]
Rule#  40 :   qeclen2 [ 1 x 1 ] ---> qeclen2 [ (1, N) (x, N) (b, L) ]
Rule#  41 :   qeclen2 [ 1 x a ] ---> qeclen2 [ (1, N) (x, N) (b, L) ]
Rule#  42 :   qeclen2 [ 1 x x ] --->  qhcode [ (1, N) (x, R) (x, N) ]
Rule#  43 :    qhcode [ 0 b x ] --->  qhcode [ (b, L) (0, R) (x, N) ]
Rule#  44 :    qhcode [ 1 b x ] --->  qhcode [ (b, L) (1, R) (x, N) ]
Rule#  45 :    qhcode [ a b x ] --->  qhcode [ (b, L) (a, R) (x, N) ]
Rule#  46 :    qhcode [ x b x ] --->      qf [ (x, N) (b, L) (x, N) ]
Rule#  47 :      qm11 [ * b b ] --->    qm12 [ (*, N) (b, L) (b, N) ]
Rule#  48 :      qm11 [ 0 b b ] --->    qm11 [ (0, R) (b, N) (b, N) ]
Rule#  49 :      qm11 [ 1 b b ] --->    qm11 [ (1, R) (b, N) (b, N) ]
Rule#  50 :      qm11 [ a b b ] --->    qm11 [ (c, R) (a, R) (b, N) ]
Rule#  51 :      qm11 [ b b b ] --->    qm13 [ (b, L) (b, N) (b, N) ]
Rule#  52 :      qm12 [ * * b ] --->    qm21 [ (*, R) (*, R) (b, N) ]
Rule#  53 :      qm12 [ * a b ] --->    qm12 [ (*, N) (a, L) (b, N) ]
Rule#  54 :      qm12 [ * x b ] --->    qm21 [ (*, R) (x, R) (b, N) ]
Rule#  55 :      qm13 [ * b b ] --->    qm14 [ (*, R) (b, N) (b, N) ]
Rule#  56 :      qm13 [ 0 b b ] --->    qm13 [ (0, L) (b, N) (b, N) ]
Rule#  57 :      qm13 [ 1 b b ] --->    qm13 [ (1, L) (b, N) (b, N) ]
Rule#  58 :      qm13 [ c b b ] --->    qm13 [ (d, L) (b, N) (b, N) ]
Rule#  59 :      qm14 [ 0 b b ] --->    qm14 [ (0, R) (b, N) (0, R) ]
Rule#  60 :      qm14 [ 1 b b ] --->    qm14 [ (1, R) (b, N) (1, R) ]
Rule#  61 :      qm14 [ b b b ] ---> qsorte1 [ (b, N) (b, N) (b, N) ]
Rule#  62 :      qm14 [ d b b ] --->    qm14 [ (d, R) (b, N) (a, R) ]
Rule#  63 :      qm21 [ * a b ] --->   qm2s1 [ (*, N) (b, R) (b, N) ]
Rule#  64 :      qm21 [ * b b ] --->    qm2e [ (*, N) (b, L) (b, N) ]
Rule#  65 :      qm21 [ 0 a b ] --->    qm21 [ (0, R) (a, N) (b, N) ]
Rule#  66 :      qm21 [ 0 b b ] --->    qm21 [ (0, R) (b, N) (b, N) ]
Rule#  67 :      qm21 [ 1 a b ] --->    qm21 [ (1, R) (a, N) (b, N) ]
Rule#  68 :      qm21 [ 1 b b ] --->    qm21 [ (1, R) (b, N) (b, N) ]
Rule#  69 :      qm21 [ a a b ] --->    qm21 [ (a, R) (a, R) (b, N) ]
Rule#  70 :      qm21 [ a b b ] --->    qmg1 [ (a, R) (b, N) (b, N) ]
Rule#  71 :      qm21 [ b a b ] --->  qme2s1 [ (b, N) (b, R) (b, N) ]
Rule#  72 :      qm21 [ b b b ] --->    qme1 [ (b, N) (*, R) (b, N) ]
Rule#  73 :      qm21 [ d a b ] --->   qm21d [ (d, R) (a, N) (b, N) ]
Rule#  74 :     qm21d [ * a b ] --->    qm21 [ (*, R) (a, N) (b, N) ]
Rule#  75 :     qm21d [ 0 a b ] --->   qm21d [ (0, R) (a, N) (b, N) ]
Rule#  76 :     qm21d [ 1 a b ] --->   qm21d [ (1, R) (a, N) (b, N) ]
Rule#  77 :     qm21d [ b a b ] --->   qme21 [ (b, N) (a, N) (b, N) ]
Rule#  78 :     qm21d [ d a b ] --->   qm21d [ (d, R) (a, N) (b, N) ]
Rule#  79 :      qm2e [ * * b ] --->    qm21 [ (*, R) (*, R) (b, N) ]
Rule#  80 :      qm2e [ * a b ] --->    qm2e [ (*, N) (a, L) (b, N) ]
Rule#  81 :      qm2e [ * x b ] --->    qm21 [ (*, R) (x, R) (b, N) ]
Rule#  82 :      qm2e [ b b b ] --->    qmer [ (b, N) (b, N) (b, N) ]
Rule#  83 :     qm2e1 [ b b b ] --->   qm2e2 [ (b, N) (*, R) (b, N) ]
Rule#  84 :     qm2e2 [ b b b ] --->   qm2e3 [ (b, L) (b, N) (b, N) ]
Rule#  85 :     qm2e3 [ * b b ] --->   qm2e4 [ (*, R) (b, N) (b, N) ]
Rule#  86 :     qm2e3 [ 0 b b ] --->   qm2e3 [ (0, L) (b, N) (b, N) ]
Rule#  87 :     qm2e3 [ 1 b b ] --->   qm2e3 [ (1, L) (b, N) (b, N) ]
Rule#  88 :     qm2e3 [ a b b ] --->   qm2e3 [ (c, L) (b, N) (b, N) ]
Rule#  89 :     qm2e4 [ 0 b b ] --->   qm2e4 [ (0, R) (b, N) (b, N) ]
Rule#  90 :     qm2e4 [ 1 b b ] --->   qm2e4 [ (1, R) (b, N) (b, N) ]
Rule#  91 :     qm2e4 [ b b b ] --->    qmer [ (b, N) (b, N) (b, N) ]
Rule#  92 :     qm2e4 [ c b b ] --->   qm2e4 [ (c, R) (b, N) (b, N) ]
Rule#  93 :     qm2s1 [ * a b ] --->   qm2s1 [ (*, N) (b, R) (b, N) ]
Rule#  94 :     qm2s1 [ * b b ] --->   qm2s2 [ (*, N) (b, L) (b, N) ]
Rule#  95 :     qm2s2 [ * * b ] --->   qm2s3 [ (*, L) (*, R) (b, N) ]
Rule#  96 :     qm2s2 [ * a b ] --->   qm2s2 [ (*, N) (a, L) (b, N) ]
Rule#  97 :     qm2s2 [ * b b ] --->   qm2s2 [ (*, N) (b, L) (b, N) ]
Rule#  98 :     qm2s2 [ * x b ] --->   qm2s3 [ (*, L) (x, R) (b, N) ]
Rule#  99 :     qm2s3 [ * a b ] --->   qm2s4 [ (*, R) (a, N) (b, N) ]
Rule# 100 :     qm2s3 [ 0 a b ] --->   qm2s3 [ (0, L) (a, N) (b, N) ]
Rule# 101 :     qm2s3 [ 1 a b ] --->   qm2s3 [ (1, L) (a, N) (b, N) ]
Rule# 102 :     qm2s3 [ a a b ] --->   qm2s3 [ (c, L) (a, N) (b, N) ]
Rule# 103 :     qm2s3 [ x a b ] --->   qm2s4 [ (x, R) (a, N) (b, N) ]
Rule# 104 :     qm2s4 [ * a b ] --->    qm21 [ (*, R) (a, R) (b, N) ]
Rule# 105 :     qm2s4 [ 0 a b ] --->   qm2s4 [ (0, R) (a, N) (b, N) ]
Rule# 106 :     qm2s4 [ 1 a b ] --->   qm2s4 [ (1, R) (a, N) (b, N) ]
Rule# 107 :     qm2s4 [ c a b ] --->   qm2s4 [ (c, R) (a, N) (b, N) ]
Rule# 108 :      qme1 [ b b b ] --->    qmer [ (b, N) (b, N) (b, N) ]
Rule# 109 :     qme21 [ b a b ] --->   qme21 [ (b, N) (a, R) (b, N) ]
Rule# 110 :     qme21 [ b b b ] --->    qmer [ (b, N) (*, R) (b, N) ]
Rule# 111 :    qme2s1 [ b a b ] --->  qme2s1 [ (b, N) (b, R) (b, N) ]
Rule# 112 :    qme2s1 [ b b b ] --->  qme2s2 [ (b, N) (b, L) (b, N) ]
Rule# 113 :    qme2s2 [ b a b ] --->   qm2e1 [ (b, N) (a, R) (b, N) ]
Rule# 114 :    qme2s2 [ b b b ] --->  qme2s2 [ (b, N) (b, L) (b, N) ]
Rule# 115 :     qmel1 [ * b b ] --->   qmel1 [ (*, L) (b, N) (b, N) ]
Rule# 116 :     qmel1 [ 0 b b ] --->   qmel1 [ (0, L) (b, N) (b, N) ]
Rule# 117 :     qmel1 [ 1 b b ] --->   qmel1 [ (1, L) (b, N) (b, N) ]
Rule# 118 :     qmel1 [ a b b ] --->   qmel1 [ (a, L) (b, N)
...

read more »


    Reply to author    Forward  
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
Discussion subject changed to "Computing Huffman codes on a Turing Machine (Fragments of raw log file)" by Alex Vinokur
Alex Vinokur  
View profile
  More options Jul 1 2004, 1:58 am
Newsgroups: misc.test
From: "Alex Vinokur" <ale...@big.foot.com>
Date: Thu, 1 Jul 2004 08:58:09 +0300
Local: Thurs, Jul 1 2004 1:58 am
Subject: Computing Huffman codes on a Turing Machine (Fragments of raw log file)
Reply to author | Forward | Print | Individual message | Show original | Report this message | Find messages by this author
Fragments of Raw log file

 #=================================================
 # Nondeterministic Turing Machine (C++ Simulator)
 #   http://sourceforge.net/projects/turing-machine
 #   Version 2.2
 #   -----------
 #   Alex Vinokur
 #   http://up.to/alexvn
 #   ale...@connect.to
 #-------------------------------------------------
 # CYGWIN
 # GNU gcc version 3.3.1
 #-------------------------------------------------
 # START
 # Thu Jul  1 08:28:42 2004
 #=================================================

        %%===========================================
        %%=== Nondeterministic Turing Machine# 1 ====
        %%======= Machine Definition : BEGIN ========
        %%===========================================

 ###### Nondeterministic Turing Machine Definition ######
 ###### This Machine is actually Deterministic!!!  ######

    ====== Description ======
Computing Huffman codes on a Turing Machine (Version 1.1)

Input:
  Tape#0 : Weights
  Tape#1 : Empty
  Tape#2 : Empty

Output:
  Tape#0 : Weights and its Huffman codes
  Tape#1 : Empty
  Tape#2 : Empty

    ====== States Definition ======
Initial states  : q0
Halting states  : qf
Internal states : qc01 qc02 qc03 qc04 qc05 qc06 qc07
                  qe01 qe02 qe03 qe04 qe05 qe06 qe07 qe08 qe09 qe10
                  qh01
                  qm01 qm02 qm03 qm04 qm05 qm06 qm07 qm08 qm09 qm10
                       qm11 qm12 qm13 qm14 qm15 qm16 qm17 qm18 qm19
                       qm20 qm21 qm22 qm23 qm24 qm25 qm26
                       qmif qmin
                  qs01 qs02 qs03 qs04 qs05 qs06 qs07 qs08
                  qst1 qst2 qst3

    ====== Alphabet Definition ======
       ------ Tape# 0 ------
Empty symbols alphabet : b
Input alphabet         : a *
Internal alphabet      : x c d 1 0 #

       ------ Tape# 1 ------
Empty symbols alphabet : b
Input alphabet         : a *
Internal alphabet      : x c d 1 0 #

       ------ Tape# 2 ------
Empty symbols alphabet : b
Input alphabet         : a *
Internal alphabet      : x c d 1 0 #

    ====== Transition Rules Definition ======

Rule#   0 :     q0 [ a b b ] --->   q0 [ (a, L) (b, L) (b, L) ]
Rule#   1 :     q0 [ b b b ] ---> qm01 [ (x, R) (x, R) (x, R) ]
Rule#   2 :   qc01 [ b x * ] ---> qc02 [ (0, R) (x, N) (*, N) ]
Rule#   3 :   qc01 [ b x 0 ] ---> qc03 [ (0, R) (x, N) (0, R) ]
Rule#   4 :   qc01 [ b x 1 ] ---> qc03 [ (1, R) (x, N) (1, R) ]
Rule#   5 :   qc01 [ b x a ] ---> qc01 [ (a, R) (x, N) (a, R) ]
Rule#   6 :   qc02 [ b x * ] ---> qc04 [ (b, N) (x, N) (*, R) ]
Rule#   7 :   qc03 [ b x * ] ---> qc02 [ (0, R) (x, N) (*, N) ]
Rule#   8 :   qc03 [ b x 0 ] ---> qc03 [ (0, R) (x, N) (0, R) ]
Rule#   9 :   qc03 [ b x 1 ] ---> qc03 [ (1, R) (x, N) (1, R) ]
Rule#  10 :   qc03 [ b x a ] ---> qc01 [ (0, R) (x, N) (a, N) ]
Rule#  11 :   qc04 [ b x * ] ---> qc06 [ (1, R) (x, N) (*, N) ]
Rule#  12 :   qc04 [ b x 0 ] ---> qc05 [ (0, R) (x, N) (0, R) ]
Rule#  13 :   qc04 [ b x 1 ] ---> qc05 [ (1, R) (x, N) (1, R) ]
Rule#  14 :   qc04 [ b x a ] ---> qc04 [ (a, R) (x, N) (a, R) ]
Rule#  15 :   qc04 [ b x b ] ---> qs07 [ (1, R) (x, N) (b, N) ]
Rule#  16 :   qc05 [ b x * ] ---> qc06 [ (1, R) (x, N) (*, N) ]
Rule#  17 :   qc05 [ b x 0 ] ---> qc05 [ (0, R) (x, N) (0, R) ]
Rule#  18 :   qc05 [ b x 1 ] ---> qc05 [ (1, R) (x, N) (1, R) ]
Rule#  19 :   qc05 [ b x a ] ---> qc04 [ (1, R) (x, N) (a, N) ]
Rule#  20 :   qc05 [ b x b ] ---> qs06 [ (1, N) (x, N) (*, N) ]
Rule#  21 :   qc06 [ b x * ] ---> qc07 [ (*, R) (x, N) (*, R) ]
Rule#  22 :   qc07 [ b x * ] ---> qc07 [ (*, R) (x, N) (*, R) ]
Rule#  23 :   qc07 [ b x 0 ] ---> qc07 [ (0, R) (x, N) (0, R) ]
Rule#  24 :   qc07 [ b x 1 ] ---> qc07 [ (1, R) (x, N) (1, R) ]
Rule#  25 :   qc07 [ b x a ] ---> qc07 [ (a, R) (x, N) (a, R) ]
Rule#  26 :   qc07 [ b x b ] ---> qs07 [ (b, N) (x, N) (b, N) ]
Rule#  27 :   qe01 [ 0 b x ] ---> qe01 [ (0, L) (b, N) (x, N) ]
Rule#  28 :   qe01 [ 1 b x ] ---> qe01 [ (1, L) (b, N) (x, N) ]
Rule#  29 :   qe01 [ a b x ] ---> qe01 [ (a, L) (b, N) (x, N) ]
Rule#  30 :   qe01 [ x b x ] ---> qe02 [ (x, R) (b, N) (x, R) ]
Rule#  31 :   qe02 [ 0 b b ] ---> qe03 [ (0, R) (b, N) (0, R) ]
Rule#  32 :   qe02 [ 1 b b ] ---> qe03 [ (1, R) (b, N) (1, R) ]
Rule#  33 :   qe02 [ a b b ] ---> qe02 [ (a, R) (b, N) (a, R) ]
Rule#  34 :   qe03 [ 0 b b ] ---> qe03 [ (0, R) (b, N) (0, R) ]
Rule#  35 :   qe03 [ 1 b b ] ---> qe03 [ (1, R) (b, N) (1, R) ]
Rule#  36 :   qe03 [ a b b ] ---> qe04 [ (a, N) (b, N) (*, R) ]
Rule#  37 :   qe03 [ b b b ] ---> qe05 [ (b, L) (b, N) (b, N) ]
Rule#  38 :   qe04 [ a b b ] ---> qe02 [ (a, R) (b, N) (a, R) ]
Rule#  39 :   qe05 [ 0 b b ] ---> qe05 [ (b, L) (b, N) (b, N) ]
Rule#  40 :   qe05 [ 1 b b ] ---> qe05 [ (b, L) (b, N) (b, N) ]
Rule#  41 :   qe05 [ a b b ] ---> qe05 [ (b, L) (b, N) (b, N) ]
Rule#  42 :   qe05 [ x b b ] ---> qe06 [ (x, N) (b, N) (b, L) ]
Rule#  43 :   qe06 [ x b * ] ---> qe06 [ (x, N) (b, N) (*, L) ]
Rule#  44 :   qe06 [ x b 0 ] ---> qe06 [ (x, N) (b, N) (0, L) ]
Rule#  45 :   qe06 [ x b 1 ] ---> qe06 [ (x, N) (b, N) (1, L) ]
Rule#  46 :   qe06 [ x b a ] ---> qe06 [ (x, N) (b, N) (a, L) ]
Rule#  47 :   qe06 [ x b x ] ---> qe07 [ (x, R) (b, N) (x, R) ]
Rule#  48 :   qe07 [ b b * ] ---> qe07 [ (*, R) (b, N) (b, R) ]
Rule#  49 :   qe07 [ b b 0 ] ---> qe07 [ (0, R) (b, N) (b, R) ]
Rule#  50 :   qe07 [ b b 1 ] ---> qe07 [ (1, R) (b, N) (b, R) ]
Rule#  51 :   qe07 [ b b a ] ---> qe07 [ (a, R) (b, N) (b, R) ]
Rule#  52 :   qe07 [ b b b ] ---> qe08 [ (b, N) (b, N) (b, L) ]
Rule#  53 :   qe08 [ b b b ] ---> qe08 [ (b, N) (b, N) (b, L) ]
Rule#  54 :   qe08 [ b b x ] ---> qe09 [ (b, L) (b, N) (x, N) ]
Rule#  55 :   qe09 [ * b x ] ---> qe09 [ (*, L) (b, N) (x, N) ]
Rule#  56 :   qe09 [ 0 b x ] ---> qe09 [ (0, L) (b, N) (x, N) ]
Rule#  57 :   qe09 [ 1 b x ] ---> qe09 [ (1, L) (b, N) (x, N) ]
Rule#  58 :   qe09 [ a b x ] ---> qe09 [ (a, L) (b, N) (x, N) ]
Rule#  59 :   qe09 [ x b x ] ---> qe10 [ (#, R) (b, N) (x, R) ]
Rule#  60 :   qe10 [ a b b ] ---> qm01 [ (a, N) (b, N) (b, N) ]
Rule#  61 :   qh01 [ b x * ] ---> qh01 [ (b, N) (x, N) (b, L) ]
Rule#  62 :   qh01 [ b x 0 ] ---> qh01 [ (0, R) (x, N) (b, L) ]
Rule#  63 :   qh01 [ b x 1 ] ---> qh01 [ (1, R) (x, N) (b, L) ]
Rule#  64 :   qh01 [ b x a ] ---> qh01 [ (a, R) (x, N) (b, L) ]
Rule#  65 :   qh01 [ b x x ] --->   qf [ (b, N) (b, N) (b, N) ]
Rule#  66 :   qm01 [ * b b ] ---> qm01 [ (*, R) (b, N) (b, N) ]
Rule#  67 :   qm01 [ 0 b b ] ---> qm01 [ (0, R) (b, N) (b, N) ]
Rule#  68 :   qm01 [ 1 b b ] ---> qm01 [ (1, R) (b, N) (b, N) ]
Rule#  69 :   qm01 [ a b b ] ---> qm02 [ (a, N) (b, N) (b, N) ]
Rule#  70 :   qm01 [ b b b ] ---> qs01 [ (b, N) (b, L) (b, N) ]
Rule#  71 :   qm01 [ d b b ] ---> qm01 [ (d, R) (b, N) (b, N) ]
Rule#  72 :   qm02 [ * b b ] ---> qm03 [ (*, N) (b, L) (b, N) ]
Rule#  73 :   qm02 [ 0 b b ] ---> qm02 [ (0, R) (b, N) (b, N) ]
Rule#  74 :   qm02 [ 1 b b ] ---> qm02 [ (1, R) (b, N) (b, N) ]
Rule#  75 :   qm02 [ a b b ] ---> qm02 [ (c, R) (a, R) (b, N) ]
Rule#  76 :   qm02 [ b b b ] ---> qm04 [ (b, L) (b, N) (b, N) ]
Rule#  77 :   qm03 [ * * b ] ---> qm06 [ (*, R) (*, R) (b, N) ]
Rule#  78 :   qm03 [ * a b ] ---> qm03 [ (*, N) (a, L) (b, N) ]
Rule#  79 :   qm03 [ * x b ] ---> qm06 [ (*, R) (x, R) (b, N) ]
Rule#  80 :   qm04 [ * b b ] ---> qm05 [ (*, R) (b, N) (b, N) ]
Rule#  81 :   qm04 [ 0 b b ] ---> qm04 [ (0, L) (b, N) (b, N) ]
Rule#  82 :   qm04 [ 1 b b ] ---> qm04 [ (1, L) (b, N) (b, N) ]
Rule#  83 :   qm04 [ c b b ] ---> qm04 [ (d, L) (b, N) (b, N) ]
Rule#  84 :   qm05 [ 0 b b ] ---> qm05 [ (0, R) (b, N) (0, R) ]
Rule#  85 :   qm05 [ 1 b b ] ---> qm05 [ (1, R) (b, N) (1, R) ]
Rule#  86 :   qm05 [ b b b ] ---> qs01 [ (b, N) (b, N) (b, N) ]
Rule#  87 :   qm05 [ d b b ] ---> qm05 [ (d, R) (b, N) (a, R) ]
Rule#  88 :   qm06 [ * a b ] ---> qm08 [ (*, N) (b, R) (b, N) ]
Rule#  89 :   qm06 [ * b b ] ---> qm07 [ (*, N) (b, L) (b, N) ]
Rule#  90 :   qm06 [ 0 a b ] ---> qm06 [ (0, R) (a, N) (b, N) ]
Rule#  91 :   qm06 [ 0 b b ] ---> qm06 [ (0, R) (b, N) (b, N) ]
Rule#  92 :   qm06 [ 1 a b ] ---> qm06 [ (1, R) (a, N) (b, N) ]
Rule#  93 :   qm06 [ 1 b b ] ---> qm06 [ (1, R) (b, N) (b, N) ]
Rule#  94 :   qm06 [ a a b ] ---> qm06 [ (a, R) (a, R) (b, N) ]
Rule#  95 :   qm06 [ a b b ] ---> qm12 [ (a, R) (b, N) (b, N) ]
Rule#  96 :   qm06 [ b a b ] ---> qm14 [ (b, N) (b, R) (b, N) ]
Rule#  97 :   qm06 [ b b b ] ---> qm13 [ (b, N) (*, R) (b, N) ]
Rule#  98 :   qm06 [ d a b ] ---> qm25 [ (d, R) (a, N) (b, N) ]
Rule#  99 :   qm07 [ * * b ] ---> qm06 [ (*, R) (*, R) (b, N) ]
Rule# 100 :   qm07 [ * a b ] ---> qm07 [ (*, N) (a, L) (b, N) ]
Rule# 101 :   qm07 [ * x b ] ---> qm06 [ (*, R) (x, R) (b, N) ]
Rule# 102 :   qm07 [ b b b ] ---> qmif [ (b, N) (b, N) (b, N) ]
Rule# 103 :   qm08 [ * a b ] ---> qm08 [ (*, N) (b, R) (b, N) ]
Rule# 104 :   qm08 [ * b b ] ---> qm09 [ (*, N) (b, L) (b, N) ]
Rule# 105 :   qm09 [ * * b ] ---> qm10 [ (*, L) (*, R) (b, N) ]
Rule# 106 :   qm09 [ * a b ] ---> qm09 [ (*, N) (a, L) (b, N) ]
Rule# 107 :   qm09 [ * b b ] ---> qm09 [ (*, N) (b, L) (b, N) ]
Rule# 108 :   qm09 [ * x b ] ---> qm10 [ (*, L) (x, R) (b, N) ]
Rule# 109 :   qm10 [ * a b ] ---> qm11 [ (*, R) (a, N) (b, N) ]
Rule# 110 :   qm10 [ 0 a b ] ---> qm10 [ (0, L) (a, N) (b, N) ]
Rule# 111 :   qm10 [ 1 a b ] ---> qm10 [ (1, L) (a, N) (b, N) ]
Rule# 112 :   qm10 [ a a b ] ---> qm10 [ (c, L) (a, N) (b, N) ]
Rule# 113 :   qm10 [ x a b ] ---> qm11 [ (x, R) (a, N) (b, N) ]
Rule# 114 :   qm11 [ * a b ] ---> qm06 [ (*, R) (a, R) (b, N) ]
Rule# 115 :   qm11 [ 0 a b ] ---> qm11 [ (0, R) (a, N) (b, N) ]
Rule# 116 :   qm11 [ 1 a b ] ---> qm11 [ (1, R) (a, N) (b, N) ]
Rule# 117 :   qm11 [ c a b ] ---> qm11 [ (c, R) (a, N) (b, N) ]
Rule# 118 :   qm12 [ * * b ] ---> qm06 [ (*, R) (*, R) (b, N) ]
Rule# 119 :   qm12 [ * a b ] ---> qm12 [ (*, N) (a, L) (b, N) ]
Rule# 120 :   qm12 [ * b b ] ---> qm12 [ (*, N) (b, L) (b, N) ]
Rule# 121 :   qm12 [ * x b ] ---> qm06 [ (*, R) (x, R) (b, N) ]
Rule# 122 :   qm12 [ 0 b b ] ---> qm12 [ (0, R) (b, N) (b, N) ]
Rule# 123 :   qm12 [ 1 b b ] ---> qm12 [ (1,
...

read more »


    Reply to author    Forward  
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
End of messages
« Back to Discussions « Newer topic     Older topic »

Create a group - Google Groups - Google Home - Terms of Service - Privacy Policy
©2008 Google