Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,563,563 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.
2018
2018
F L ] 2 3 M ay 2 01 5 Quotient Complexities of Atoms in Regular Ideal Languages ⋆
D. Cheriton
2018
Corpus ID: 73640118
A (left) quotient of a language L by a word w is the language wL = {x | wx ∈ L}. The quotient complexity of a regular language L…
Expand
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
Sobre el teorema de Myhill-Nerode
E. G. Camarero
2015
Corpus ID: 173786268
2015
2015
Learning Component Behavior from Tests : Theory and Algorithms for Automata with Data
Sofia Cassel
2015
Corpus ID: 10519082
Formal models are often used to describe the behavior of a computer program or component. Behavioral models have many different…
Expand
2012
2012
How applying Myhill-Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding
René van Bevern
,
M. Fellows
,
Serge Gaspers
,
Frances A. Rosamond
arXiv.org
2012
Corpus ID: 26837609
2012
2012
Myhill-Nerode Methods for Hypergraphs and Applications
René van Bevern
,
M. Fellows
,
Serge Gaspers
,
Frances A. Rosamond
2012
Corpus ID: 125818713
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
2004
2004
A Note on Recognizable Sets of Unranked and Unordered Trees
L. Priese
2004
Corpus ID: 16344390
Recognizable sets of unranked, unordered trees have been introduced in Courcelle [C89] in a Myhill-Nerode [N58] style of inverse…
Expand
1976
1976
Local Adjunct Languages and Regular Sets
L. Levy
SIAM journal on computing (Print)
1976
Corpus ID: 207050866
The class of regular sets is shown to be contained in the class of local adjunct languages. The essential idea in the proof is an…
Expand