dmta-equiv.bib

   1 @book{E,
   2    author = "Samuel Eilenberg",
   3    title = "Automata, Languages and Machines",
   4    publisher = "Academic Press",
   5    year = 1974,
   6   volume =       {A}
   7 }
   8
   9
  10
  11 @Unpublished{H-incl,
  12   author =       {Mika Hirvensalo},
  13   title =        {The undecidability of the inclusion of {$\mathbb N$}-subsets},
  14   note =         {A summary of \cite{E}'s definitions important for understanding~\cite{HK}. Presented at Seminar on Automata,
  15 \url!http://users.utu.fi/mikhirve/undecid.pdf!},
  16   year =         {1996}
  17 }
  18
  19 @Article{HK,
  20   author =       "T. Harju and J. Karhumaki",
  21   title =        "The equivalence problem of multitape finite automata",
  22   journal =      "Theoretical Computer Science",
  23   volume =       "78",
  24   number =       "2",
  25   pages =        "347--355",
  26   day =          "31",
  27   month =        jan,
  28   year =         "1991",
  29   CODEN =        "TCSCDI",
  30   ISSN =         "0304-3975",
  31   bibdate =      "Sat Nov 22 13:24:22 MST 1997",
  32   acknowledgement = ack-nhfb,
  33   classification = "C4220 (Automata theory)",
  34   corpsource =   "Dept. of Math., Turku Univ., Finland",
  35   keywords =     "conservative monoids; decidability; decidable;
  36                  deterministic; equivalence classes; equivalence
  37                  problem; finite automata; finite test set; multiplicity
  38                  equivalence; multiplicity equivalence problem;
  39                  multitape finite automata",
  40   pubcountry =   "Netherlands",
  41   treatment =    "T Theoretical or Mathematical",
  42 }
  43
  44 @InProceedings{HKshort,
  45   author =       "T. Harju and J. Karhum{\"a}ki",
  46   title =        "Decidability of the Multiplicity Equivalence of
  47                  Multitape Finite Automata",
  48   pages =        "477--481",
  49   ISBN =         "0-89791-361-2",
  50   editor =       "Baruch Awerbuch",
  51   booktitle =    "Proceedings of the 22nd Annual {ACM} Symposium on the
  52                  Theory of Computing",
  53   address =      "Baltimore, MY",
  54   month =        may,
  55   year =         "1990",
  56   publisher =    "ACM Press",
  57 }
  58
  59 @InProceedings{Arch-algo,
  60   author =       "Archangelsky",
  61   title =        "Efficient Algorithm for Checking Multiplicity
  62                  Equivalence for the Finite {$\mathbb Z$-$\Sigma^*$}-Automata",
  63   booktitle =    "International Conference on Developments in Language
  64                  Theory (DLT), LNCS",
  65   volume =       "6",
  66   year =         "2002",
  67 }
  68
  69 @Article{Archangelsky97,
  70   author =       "Konstantin V. Archangelsky",
  71   title =        "A new representation for the regular languages",
  72   journal =      "Bulletin of the European Association for Theoretical
  73                  Computer Science",
  74   volume =       "63",
  75   pages =        "135--138",
  76   month =        oct,
  77   year =         "1997",
  78   note =         "Technical Contributions",
  79 }