Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,138,462 papers from all fields of science
Search
Sign In
Create Free Account
Myhill–Nerode theorem
Known as:
Myhill-Nerode Theorem
, Myhill
, Nerode's theorem
Expand
In the theory of formal languages, the Myhill–Nerode theorem provides a necessary and sufficient condition for a language to be regular. The theorem…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Brzozowski derivative
DFA minimization
Deterministic finite automaton
Empty string
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
State-space construction for scalar continuous-time transfer function via Nerode equivalence
J. Liu
,
Hong-Wen Zhang
,
Kai Liu
,
Wenxue She
Cybersecurity and Cyberforensics Conference
2016
Corpus ID: 126133186
In this paper we show that a minimal state space realisation in Jordan canonical form for linear continuous-time systems…
Expand
2015
2015
On minimal realization for a fuzzy language and Brzozowski's algorithm
SP Tiwari
,
Vinay Gautam
,
B. Davvaz
Journal of Intelligent & Fuzzy Systems
2015
Corpus ID: 40729908
The purpose of the present work is to provide a simpler solution of a well-known characterization of fuzzy regular languages and…
Expand
2012
2012
Automata and Logics over Signals
Fabrice Chevalier
,
D. D'Souza
,
Raj Mohan Matteplackel
,
P. Prabhakar
Modern Applications of Automata Theory
2012
Corpus ID: 12321096
We extend some of the classical connections between automata and logic due to Büchi [1] and McNaughton and Papert [2], to…
Expand
Review
2008
Review
2008
Myhill-Nerode Theorem for Recognizable Tree Series Revisited
A. Maletti
Latin American Symposium on Theoretical…
2008
Corpus ID: 11643779
In this contribution the MYHILL-NERODE congruence relation on tree series is reviewed and a more detailed analysis of its…
Expand
2006
2006
DFA minimisation using the Myhill-Nerode theorem
Johanna Högberg
,
L. Larsson
2006
Corpus ID: 31882403
The Myhill-Nerode theorem is an important characterisation of regular languages, and it also has many practical implications. In…
Expand
2005
2005
Minimizing Tree Automata for Unranked Trees (Extended Abstract)
W. Martens
,
Joachim Niehren
2005
Corpus ID: 46019439
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of effi…
Expand
2003
2003
The Myhill-Nerode Theorem for Recognizable Tree Series
B. Borchardt
International Conference on Developments in…
2003
Corpus ID: 34458730
In this paper we prove a Myhill-Nerode theorem for recognizable tree series over commutative semifields and thereby present a…
Expand
1996
1996
Foundations of Linguistic Geometry: Complex Systems and Winning Strategies
V. Yakhnis
1996
Corpus ID: 15239071
both the branching factor and the computation time for the systems based on LG were several times smaller than those for the…
Expand
1976
1976
Realization of discrete-time internally bilinear systems
T. Tarn
,
S. Nonoyama
IEEE Conference on Decision and Control including…
1976
Corpus ID: 25586483
From the external descriptions algorithms are obtained for the construction of discrete-time, internally bilinear state-space…
Expand
1975
1975
Realizations of fuzzy languages by probabilistic, max-product, and maximin automata
E. S. Santos
Information Sciences
1975
Corpus ID: 28044507
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE