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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1991-2017
012319912017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
In the logic and automata community, Robert McNaughton is perhaps best known for his determinisation result for automata on… (More)
Is this relevant?
2004
2004
In [8] (1920), Lukasiewicz introduced a 3-valued propositional calculus with one designated truth-value and later in [9… (More)
Is this relevant?
Review
2000
Review
2000
Potential strategies for temporal neural processing in the brain and their implications for the design of artificial neural… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
1999
In this paper we study consequence relations on the set of many sided sequents over a propositional language. We deal with the… (More)
Is this relevant?
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… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Review
1996
Review
1996
In this paper we explore the topic of the consolidation of information in neural network learning. One problem in particular has… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
1993
1993
This paper is concerned with decision proceedures for the R0-valued Lukasiewicz logics, L~ o . It is shown how linear algebra can… (More)
Is this relevant?
1993
1993
This paper shows the equivalence between the family of recognizable languages over infinite traces and the family of languages… (More)
Is this relevant?