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.
2015
2015
McNaughton's theorem
In the logic and automata community, Robert McNaughton is perhaps best known for his determinisation result for automata on… Expand
Is this relevant?
2011
2011
Determination of the Infrared Luminosity of Active Galactic Nuclei (AGN)
Varoujan Gorjian – 1, Kate Meredith – 2, Helen Petach 3, Elizabeth Ramseyer 4, Tim Spuck 5, Mark Abajian 1, Kevin Hale -3, Rozina… Expand
  • figure 1
Is this relevant?
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
Is this relevant?
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
Is this relevant?
1999
1999
A Strong Completeness Theorem for the Gentzen systems associated with finite algebras
ABSTRACT In this paper we study consequence relations on the set of many sided sequents over a propositional language. We deal… Expand
Is this relevant?
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
Is this relevant?
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
Is this relevant?
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
Is this relevant?
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
Is this relevant?
1982
1982
Some Remarks on Non-Algebraic Adherences
We present some properties of non-algebraic adherences of languages, which can be consistently called context-sensitive… Expand
Is this relevant?
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