Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

9 relations
Automata constructionAutomata theoryBüchi automatonDFA minimization
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Intestinal Stem Cells in GI Physiology and Disease Activation of two distinct Sox 9-EGFP-expressing intestinal stem cell populations during crypt regeneration after irradiation
Van Landeghem L, Santoro MA, Krebs AE, Mah AT, Dehmer JJ, Gracz AD, Scull BP, McNaughton K, Magness ST, Lund PK. Activation of… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Highly Cited
2010
Highly Cited
2010
The effect of acute physical exercise on cognitive function during development
Abstract Although accumulating research suggests that acute physical exercise ameliorates cognitive function in adults, little is… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
2005
2005
TOWARD HOW TO ADD AN AESTHETIC IMAGE TO MATHEMATICS EDUCATION
The goal of this paper is to suggest how an aesthetic image can be added to mathematics education. Calls for reform in… Expand
1999
1999
Modelling time perception in rats : evidence for catastrophic interference in animal learning
For all intents and purposes, catastrophic interference, the sudden and complete forgetting of previously stored information upon… Expand
  • figure 1
  • figure 2
  • figure 2
  • figure 3
  • figure 5
Highly Cited
1997
Highly Cited
1997
Pseudo-recurrent Connectionist Networks: An Approach to the 'Sensitivity-Stability' Dilemma
In order to solve the 'sensitivity-stability' problem-and its immediate correlate, the problem of sequential learning-it is… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
1997
1997
Minimal Separating Sets for Muller Automata
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… Expand
1993
1993
Automated theorem proving for Łukasiewicz logics
This paper is concerned with decision proceedures for the ℵ0-valued Łukasiewicz logics,. It is shown how linear algebra can be… Expand
1991
1991
A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words
We give a new, purely algebraic proof of McNaughton's theorem on infinite words, which states that each recognizable set X of… Expand
1987
1987
On shared systems
 Most computing systems are shared between users of various kinds. This thesis treats such systems as mathematical objects, and… Expand
1982
1982
Some Remarks on Non-Algebraic Adherences
  • S. Istrail
  • Theor. Comput. Sci.
  • 1982
    • Corpus ID: 45369754
We present some properties of non-algebraic adherences of languages, which can be consistently called context-sensitive… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE