Academic literature on the topic 'Pumping lemma'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Pumping lemma.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Pumping lemma"
Lu, Ruqian, and Hong Zheng. "Pumping Lemma for Quantum Automata." International Journal of Theoretical Physics 43, no. 5 (May 2004): 1191–217. http://dx.doi.org/10.1023/b:ijtp.0000048609.66662.87.
Full textKászonyi, L. "A pumping lemma for DLI-languages." Discrete Mathematics 258, no. 1-3 (December 2002): 105–22. http://dx.doi.org/10.1016/s0012-365x(02)00265-0.
Full textKostolányi, Peter. "A pumping lemma for flip-pushdown languages." RAIRO - Theoretical Informatics and Applications 50, no. 4 (June 2, 2016): 295–311. http://dx.doi.org/10.1051/ita/2016003.
Full textColton, Don. "A restated pumping lemma for context-free languages." ACM SIGACT News 24, no. 2 (April 1993): 87. http://dx.doi.org/10.1145/156063.156066.
Full textEwert, Sigrid, and Andries van der Walt. "A pumping lemma for random permitting context languages." Theoretical Computer Science 270, no. 1-2 (January 2002): 959–67. http://dx.doi.org/10.1016/s0304-3975(01)00171-2.
Full textYu, Sheng. "A pumping lemma for deterministic context-free languages." Information Processing Letters 31, no. 1 (April 1989): 47–51. http://dx.doi.org/10.1016/0020-0190(89)90108-7.
Full textGazdag, Zsolt, Krisztián Tichler, and Erzsébet Csuhaj-Varjú. "A Pumping Lemma for Permitting Semi-Conditional Languages." International Journal of Foundations of Computer Science 30, no. 01 (January 2019): 73–92. http://dx.doi.org/10.1142/s0129054119400045.
Full textFried, Michael N., and Mayer Goldberg. "A Pumping Lemma for Invalid Reductions of Fractions." College Mathematics Journal 41, no. 5 (November 2010): 357–64. http://dx.doi.org/10.4169/074683410x521955.
Full textMALETTI, ANDREAS. "RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA." International Journal of Foundations of Computer Science 16, no. 04 (August 2005): 723–41. http://dx.doi.org/10.1142/s012905410500325x.
Full textGhorani, Maryam, Sunita Garhwal, and Somaye Moghari. "Lattice-valued tree pushdown automata: Pumping lemma and closure properties." International Journal of Approximate Reasoning 142 (March 2022): 301–23. http://dx.doi.org/10.1016/j.ijar.2021.12.002.
Full textDissertations / Theses on the topic "Pumping lemma"
Cogliati, Joshua Joseph. "Visualizing the pumping lemma for regular languages." Thesis, Montana State University, 2004. http://etd.lib.montana.edu/etd/2004/cogliati/CogliatiJ0805.pdf.
Full textBarthwal, Aditi. "A formalisation of the theory of context-free languages in higher order logic." Phd thesis, 2010. http://hdl.handle.net/1885/16399.
Full textBook chapters on the topic "Pumping lemma"
Kozen, Dexter C. "Using the Pumping Lemma." In Automata and Computability, 72–76. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1844-9_13.
Full textKozen, Dexter C. "The Pumping Lemma for CFLs." In Automata and Computability, 148–56. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1844-9_26.
Full textSorokin, Alexey. "Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammars." In Developments in Language Theory, 154–65. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-09698-8_14.
Full textKwee, Kent, and Friedrich Otto. "A Pumping Lemma for Ordered Restarting Automata." In Descriptional Complexity of Formal Systems, 226–37. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-60252-3_18.
Full textSmith, Tim. "A Pumping Lemma for Two-Way Finite Transducers." In Mathematical Foundations of Computer Science 2014, 523–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44522-8_44.
Full textKalociński, Dariusz. "On Computability and Learnability of the Pumping Lemma Function." In Language and Automata Theory and Applications, 433–40. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-04921-2_35.
Full textKuske, Sabine. "A maximum path length pumping lemma for edge-replacement languages." In Fundamentals of Computation Theory, 342–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57163-9_29.
Full textKanazawa, Makoto. "The Pumping Lemma for Well-Nested Multiple Context-Free Languages." In Developments in Language Theory, 312–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02737-6_25.
Full textKühnemann, Armin. "A pumping lemma for output languages of macro tree transducers." In Trees in Algebra and Programming — CAAP '96, 44–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61064-2_28.
Full textGasperoni, Franco, Uwe Schwiegeishohn, and John Turek. "Optimal loop scheduling on multiprocessors: A pumping lemma for p-processor schedules." In Lecture Notes in Computer Science, 51–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60222-4_96.
Full textConference papers on the topic "Pumping lemma"
CUI, LICONG, and GUO-QIANG ZHANG. "A GENERALIZED NON-PUMPING LEMMA FOR REGULAR LANGUAGES." In Proceedings of the QL&SC 2012. WORLD SCIENTIFIC, 2012. http://dx.doi.org/10.1142/9789814401531_0057.
Full textGuo, Xiuhong, and Jiehong Xu. "Pumping lemma in lattice finite automata: A note." In 2012 9th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD). IEEE, 2012. http://dx.doi.org/10.1109/fskd.2012.6233708.
Full textMartinek, Pavel. "Fuzzy multiset finite automata: Determinism, languages, and pumping lemma." In 2015 12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD). IEEE, 2015. http://dx.doi.org/10.1109/fskd.2015.7381915.
Full textGal-Ezer, Judith, and Mark Trakhtenbrot. "Challenges in teaching the pumping lemma in automata theory course." In the 10th annual SIGCSE conference. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1067445.1067569.
Full textDharaneetharan, G. D., V. Brammanandha Raj, and R. Kanniga Devi. "An alternative approach of Pumping Lemma to prove a language to be non regular." In 2011 International Conference on Recent Trends in Information Technology (ICRTIT). IEEE, 2011. http://dx.doi.org/10.1109/icrtit.2011.5972352.
Full textJohnsonbaugh, Richard, and David P. Miller. "Converses of pumping lemmas." In the twenty-first SIGCSE technical symposium. New York, New York, USA: ACM Press, 1990. http://dx.doi.org/10.1145/323410.319073.
Full textSmith, Therese, and Robert McCartney. "Mathematization in teaching pumping lemmas." In 2013 IEEE Frontiers in Education Conference (FIE). IEEE, 2013. http://dx.doi.org/10.1109/fie.2013.6685122.
Full text