, view all tags
Here is a nice new page to describe automata theory results.

In class today (27 Feb) we mentioned Buchi's Theorem, that a language is regular iff it can be

defined by a formula in second-order monadic logic.

-- BarrinG - 2012-02-27

Edit | Attach | Print version | History: r3 < r2 < r1 | Backlinks | Raw View | Raw edit | More topic actions...
Topic revision: r1 - 2012-02-27 - BarrinG
  • 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