Pumping, with or without choice
From MaRDI portal
Publication:6536320
DOI10.1007/978-3-030-34175-6_22zbMATH Open1542.68084MaRDI QIDQ6536320FDOQ6536320
Aquinas Hobor, Frank Stephan, Elaine Li
Publication date: 19 April 2024
Formal languages and automata (68Q45) Formalization of mathematics in connection with theorem provers (68V20) Axiom of choice and related propositions (03E25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unified Decision Procedures for Regular Expression Equivalence
- Axiom of Choice and Complementation
- On certain formal properties of grammars
- The calculus of constructions
- On the computational content of the axiom of choice
- On the Formalization of Some Results of Context-Free Language Theory
- Proof Pearl: regular expression equivalence and relation algebra
- Linear Automaton Transformations
- On a problem of formal logic.
- A Constructive Theory of Regular Languages in Coq
- Pumping Lemmas for Regular Sets
- A Decision Procedure for Regular Expression Equivalence in Type Theory
- A Pumping Condition for Regular Sets
- On block pumpable languages
- Sur la décomposition des ensembles de points en parties respectivement congruentes.
- Regular language representations in the constructive type theory of Coq
- A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions (Proof Pearl)
- Partial Derivative Automata Formalized in Coq
- On computable numbers, with an application to the Entscheidungsproblem. A correction.
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)
