A formalisation of the Myhill-Nerode theorem based on regular expressions (Q2351151): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Partial Derivative Automata Formalized in Coq / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial derivatives of regular expressions and finite automaton constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Compact Proof of Decidability for Regular Expression Equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalizing the Logic-Automaton Connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivatives of Regular Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decision Procedure for Regular Expression Equivalence in Type Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constructive Theory of Regular Languages in Coq / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding SUBSEQ\((A)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular-expression derivatives re-examined / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinctness of the Complement and Intersection of Regular Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: EDUCATIONAL PEARL: ‘Proof-directed debugging’ revisited for a first-order version / rank
 
Normal rank
Property / cites work
 
Property / cites work: On free monoids partially ordered by embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof-directed debugging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof Pearl: regular expression equivalence and relation algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Data Refinement for Monadic Programs to Hopcroft’s Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adapting functional programs to higher order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3644388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Second Course in Formal Languages and Automata Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified Kruskal’s Tree Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions (Proof Pearl) / rank
 
Normal rank

Revision as of 07:25, 10 July 2024

scientific article
Language Label Description Also known as
English
A formalisation of the Myhill-Nerode theorem based on regular expressions
scientific article

    Statements

    A formalisation of the Myhill-Nerode theorem based on regular expressions (English)
    0 references
    0 references
    0 references
    0 references
    23 June 2015
    0 references
    regular languages
    0 references
    theorem provers
    0 references
    Myhill-Nerode theorem
    0 references

    Identifiers