A Decision Procedure for Regular Expression Equivalence in Type Theory (Q3100207): 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: On streams that are finitely red / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Coq Tactic for Deciding Kleene Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivatives of Regular Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Second‐Order Arithmetic and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145861 / 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: Terminating general recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular-expression derivatives re-examined / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well quasi-ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3075246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certification of Termination Proofs Using CeTA / 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

Latest revision as of 15:51, 4 July 2024

scientific article
Language Label Description Also known as
English
A Decision Procedure for Regular Expression Equivalence in Type Theory
scientific article

    Statements

    Identifiers