Skip to search formSkip to main contentSkip to account menu

McNaughton's theorem

In automata theory, McNaughton's theorem refers to a theorem that asserts that the set of ω-regular languages is identical to the set of languages… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
  • R. French, A. Ferrara
  • Proceedings of the Twenty First Annual Conference…
  • 2020
  • Corpus ID: 15446791
For all intents and purposes, catastrophic interference, the sudden and complete forgetting of previously stored information upon… 
2015
2015
Abstract This article offers a critique of Hilmar Farid's (and to a lesser extent, Colm McNaughton's) contribution in this… 
2010
2010
2005
2005
The goal of this paper is to suggest how an aesthetic image can be added to mathematics education. Calls for reform in… 
Highly Cited
1997
Highly Cited
1997
In order to solve the 'sensitivity-stability' problem-and its immediate correlate, the problem of sequential learning-it is… 
1997
1997
For a Muller automaton only a subset of its states is needed to decide whether a run is accepting or not: The set I the… 
Review
1996
Review
1996
  • A. Robins
  • Connect. Sci.
  • 1996
  • Corpus ID: 18817459
In this paper we explore the topic of the consolidation of information in neural network learning. One problem in particular has… 
1993
1993
This paper is concerned with decision proceedures for the ℵ0-valued Łukasiewicz logics,. It is shown how linear algebra can be… 
1982
1982
  • S. Istrail
  • Theor. Comput. Sci.
  • 1982
  • Corpus ID: 45369754