Tags:
, view all tags
Buchi's Theorem says that a language is definable in second-order monadic logic iff it is regular.

Putting up proof of Buchi's thm (both directions).

-- SvorotnI - 2012-03-25

Edit | Attach | Print version | History: r3 < r2 < r1 | Backlinks | Raw View | Raw edit | More topic actions...
Topic revision: r1 - 2012-03-25 - SvorotnI
 
  • Edit
  • Attach
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2019 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding UMass CS EdLab? Send feedback

mersin escort adana escort izmir escort gaziantep escort