Pumping, with or without choice
From MaRDI portal
Publication:6536320
DOI10.1007/978-3-030-34175-6_22zbMATH Open1542.68084MaRDI QIDQ6536320FDOQ6536320
Recommendations
Cites Work
- scientific article; zbMATH DE number 3703994 (Why is no real title available?)
- scientific article; zbMATH DE number 3617584 (Why is no real title available?)
- scientific article; zbMATH DE number 3238653 (Why is no real title available?)
- A Decision Procedure for Regular Expression Equivalence in Type Theory
- A Pumping Condition for Regular Sets
- A constructive theory of regular languages in Coq
- A formalisation of the Myhill-Nerode theorem based on regular expressions (proof pearl)
- Axiom of Choice and Complementation
- Linear Automaton Transformations
- On a problem of formal logic.
- On block pumpable languages
- On certain formal properties of grammars
- On computable numbers, with an application to the Entscheidungsproblem. A correction.
- On the computational content of the axiom of choice
- On the formalization of some results of context-free language theory
- Partial derivative automata formalized in Coq
- Proof Pearl: regular expression equivalence and relation algebra
- Pumping Lemmas for Regular Sets
- Regular language representations in the constructive type theory of Coq
- Sur la décomposition des ensembles de points en parties respectivement congruentes.
- The calculus of constructions
- Unified decision procedures for regular expression equivalence
This page was built for publication: Pumping, with or without choice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536320)
