Article View: sci.logic
Article #186infinite state automaton
From: Leslie Burkholder
Date: Wed, 02 Sep 1992 21:25
Date: Wed, 02 Sep 1992 21:25
5 lines
630 bytes
630 bytes
Suppose we allow an automaton to have an infinite rather than a finite number of states. Is that (equivalent to) a Turing machine? References, please. Thanks, Leslie Burkholder
Technical Details
Message-ID:
<UedH4ge00WB80CdOB6@andrew.cmu.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!cis.ohio-state.edu!news.sei.cmu.edu!fs7.ece.cmu.edu!crabapple.srv.cs.cmu.edu!andrew.cmu.edu!lb0q+Show Full Headers
Complete Article Headers
Organization: Carnegie Mellon, Pittsburgh, PA Path: arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!cis.ohio-state.edu!news.sei.cmu.edu!fs7.ece.cmu.edu!crabapple.srv.cs.cmu.edu!andrew.cmu.edu!lb0q+ Newsgroups: sci.logic Message-ID: <UedH4ge00WB80CdOB6@andrew.cmu.edu> Date: Wed, 2 Sep 1992 17:25:00 -0400 From: Leslie Burkholder <lb0q+@andrew.cmu.edu> Subject: infinite state automaton In-Reply-To: <OZ.92Sep1203824@ursa.sis.yorku.ca> Lines: 5