Gruber HHolzer MRauch C(2024)On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract)Implementation and Application of Automata10.1007/978-3-031-71112-1_11(153-165)Online publication date: 3-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-71112-1_11
Gruber HHolzer MRauch C(2024)The Pumping Lemma for Context-Free Languages is UndecidableDevelopments in Language Theory10.1007/978-3-031-66159-4_11(141-155)Online publication date: 12-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-66159-4_11
Holzer MRauch C(2023)On Minimal Pumping Constants for Regular LanguagesElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.386.11386(127-141)Online publication date: 3-Sep-2023
https://doi.org/10.4204/EPTCS.386.11
Show More Cited By

A necessary and sufficient pumping lemma for regular languages
1. Theory of computation

Recommendations

Necessary and sufficient conditions in constrained optimization

Additional conditions are attached to the Kuhn-Tucker conditions giving a set of conditions which are both necessary and sufficient for optimality in constrained optimization, under appropriate constraint qualifications. Necessary and sufficient ...
On Some Methods to Derive Necessary and Sufficient Optimality Conditions in Vector Optimization

The aim of this paper is to address new approaches, in separate ways, to necessary and, respectively, sufficient optimality conditions in constrained vector optimization. In this respect, for the necessary optimality conditions that we derive, we use a ...
Comparisons between some pumping conditions for context-free languages
Abstract
We present a systematic investigation of the relationships between various pumping properties—the classic pumping condition of Bar-Hillelet al., Ogden's condition, a generalized Ogden condition of Bader and Moura, Sokolowski's condition, an ...

Comments

comments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGACT News Volume 10, Issue 2

Summer 1978

24 pages

ISSN:0163-5700

DOI:10.1145/990524

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1978

Published in SIGACT Volume 10, Issue 2

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
1,490
Total Downloads

Downloads (Last 12 months)230
Downloads (Last 6 weeks)18

Reflects downloads up to 20 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gruber HHolzer MRauch C(2024)On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract)Implementation and Application of Automata10.1007/978-3-031-71112-1_11(153-165)Online publication date: 3-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-71112-1_11
Gruber HHolzer MRauch C(2024)The Pumping Lemma for Context-Free Languages is UndecidableDevelopments in Language Theory10.1007/978-3-031-66159-4_11(141-155)Online publication date: 12-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-66159-4_11
Holzer MRauch C(2023)On Minimal Pumping Constants for Regular LanguagesElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.386.11386(127-141)Online publication date: 3-Sep-2023
https://doi.org/10.4204/EPTCS.386.11
Gruber HHolzer MRauch C(2023)The Pumping Lemma for Regular Languages is HardImplementation and Application of Automata10.1007/978-3-031-40247-0_9(128-140)Online publication date: 10-Aug-2023
https://doi.org/10.1007/978-3-031-40247-0_9
Holzer MRauch C(2023)On Jaffe’s Pumping Lemma, RevisitedDescriptional Complexity of Formal Systems10.1007/978-3-031-34326-1_5(65-78)Online publication date: 24-Jun-2023
https://doi.org/10.1007/978-3-031-34326-1_5
Pin J(2020)How to Prove that a Language Is Regular or Star-Free?Language and Automata Theory and Applications10.1007/978-3-030-40608-0_5(68-88)Online publication date: 4-Mar-2020
https://dl.acm.org/doi/10.1007/978-3-030-40608-0_5
Hobor ALi EStephan F(2019)Pumping, with or Without ChoiceProgramming Languages and Systems10.1007/978-3-030-34175-6_22(427-446)Online publication date: 18-Nov-2019
https://doi.org/10.1007/978-3-030-34175-6_22
Chak CFreivalds RStephan FTan Wan Yik H(2016)On block pumpable languagesTheoretical Computer Science10.1016/j.tcs.2015.10.008609:P1(272-285)Online publication date: 4-Jan-2016
https://dl.acm.org/doi/10.1016/j.tcs.2015.10.008
Ilčík MMusialski PAuzinger TWimmer M(2015)Layer-Based Procedural Design of FaçadesComputer Graphics Forum10.1111/cgf.1255334:2(205-216)Online publication date: 1-May-2015
https://dl.acm.org/doi/10.1111/cgf.12553
Schosser SVogt B(2015)What Automaton Model Captures Decision Making? The Necessity of Behavioral Complexity2015 IEEE International Conference on Smart City/SocialCom/SustainCom (SmartCity)10.1109/SmartCity.2015.76(229-235)Online publication date: Dec-2015
https://doi.org/10.1109/SmartCity.2015.76
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Necessary and sufficient conditions in constrained optimization

On Some Methods to Derive Necessary and Sufficient Optimality Conditions in Vector Optimization

Comparisons between some pumping conditions for context-free languages

Comments

Published In

Publisher

Publication History

Check for updates

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Abstract

References

Cited By

Recommendations

Necessary and sufficient conditions in constrained optimization

On Some Methods to Derive Necessary and Sufficient Optimality Conditions in Vector Optimization

Comparisons between some pumping conditions for context-free languages

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.