scientific article; zbMATH DE number 3617584
From MaRDI portal
Publication:4181301
Cited in
(17)- A pumping lemma for real-time deterministic context-free languages
- Notes on finitely generated semigroups and pumping conditions for regular languages
- Notes on congruence relations and factor pumping conditions for rational languages
- Recursion and pumping in L forms
- Generalized cancellation-and-permutation properties, regular languages and supports of rational series
- scientific article; zbMATH DE number 3703994 (Why is no real title available?)
- A note on the pumping lemma for regular languages
- On Jaffe's pumping lemma, revisited
- The pumping lemma for regular languages is hard
- On Minimal Pumping Constants for Regular Languages
- Pumping, with or without choice
- On pumping preserving homomorphisms and the complexity of the pumping problem (extended abstract)
- On Jaffe's pumping lemma, revisited
- The pumping lemma for regular languages is hard
- The pumping lemma for context-free languages is undecidable
- Extended formulations for control languages defined by finite-state automata
- On block pumpable languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4181301)
