Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,206,672 papers from all fields of science
Search
Sign In
Create Free Account
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
Create Alert
Alert
Related topics
Related topics
9 relations
Automata construction
Automata theory
Büchi automaton
DFA minimization
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Modeling time perception in rats: Evidence for catastrophic interference in animal learning
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…
Expand
2015
2015
Capitalism, primitive accumulation and the 1960s' massacres: revisiting the New Order and its violent genesis
V. Hadiz
2015
Corpus ID: 142818694
Abstract This article offers a critique of Hilmar Farid's (and to a lesser extent, Colm McNaughton's) contribution in this…
Expand
Highly Cited
2010
Highly Cited
2010
The effect of acute physical exercise on cognitive function during development
D. Ellemberg
,
Mathilde St-Louis-Deschênes
2010
Corpus ID: 51961422
2010
2010
Representation theory of MV-algebras
E. Dubuc
,
Y. Poveda
Ann. Pure Appl. Log.
2010
Corpus ID: 17600035
2005
2005
TOWARD HOW TO ADD AN AESTHETIC IMAGE TO MATHEMATICS EDUCATION
P. Betts
2005
Corpus ID: 2180709
The goal of this paper is to suggest how an aesthetic image can be added to mathematics education. Calls for reform in…
Expand
Highly Cited
1997
Highly Cited
1997
Pseudo-recurrent Connectionist Networks: An Approach to the 'Sensitivity-Stability' Dilemma
R. French
Connect. Sci.
1997
Corpus ID: 569403
In order to solve the 'sensitivity-stability' problem-and its immediate correlate, the problem of sequential learning-it is…
Expand
1997
1997
Minimal Separating Sets for Muller Automata
Helmut Lescow
,
Jens Vöge
Workshop on Implementing Automata
1997
Corpus ID: 7921447
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
Review
1996
Review
1996
Consolidation in Neural Networks and in the Sleeping Brain
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…
Expand
1993
1993
Automated theorem proving for Łukasiewicz logics
G. Beavers
Stud Logica
1993
Corpus ID: 30916657
This paper is concerned with decision proceedures for the ℵ0-valued Łukasiewicz logics,. It is shown how linear algebra can be…
Expand
1982
1982
Some Remarks on Non-Algebraic Adherences
S. Istrail
Theor. Comput. Sci.
1982
Corpus ID: 45369754
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