Cited By
View all- Doczkal CSmolka G(2018)Regular Language Representations in the Constructive Type Theory of CoqJournal of Automated Reasoning10.1007/s10817-018-9460-x61:1-4(521-553)Online publication date: 1-Jun-2018
Converses of pumping lemmas
References
[1]
L. Boasson and S. Horvath. On languages satisfying Ogden's Lemma. R.A.LR.O. Theoretical Comp. Sci., 12:201-202, 1978.
[2]
A. Ehrenfeucht, R. Parikh, and G. Rozenberg. Pumping lemmas for rcgula.r sets. Siam J. Comput., 10:536-541, 1981.
[3]
S. Ginsburg and H. G. Rice. Two families of languages related to ALGOL. J. A CM, 9:350- 371, 1962.
[4]
J.E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
[5]
W. Ogden. A helpful result for proving inherent ambiguity. Malh. Syslems Theory, 2:191- 194, 1968.
[6]
R.J. Parikh. On context-free languages. J. A CM, 13:570-581, 1966.
[7]
D. S. Wise. A strong pumping lemma for context-free languages. Theoretical Comp. Sci., 3:359-369, 1976.
Index Terms
- Converses of pumping lemmas
Recommendations
Two relaxed quadratic function negative-determination lemmas: Application to time-delay systems
AbstractComplicated construction of Lyapunov–Krasovskii functional (LKF) makes the quadratic correlation terms of time-delay appear in its derivative. This paper proposes two relaxed negative-determination lemmas to deduce the negative definite condition ...
Bounded real lemmas for fractional order systems
This paper derives the bounded real lemmas corresponding to L norm and H norm (L-BR and H-BR) of fractional order systems. The lemmas reduce the original computations of norms into linear matrix inequality (LMI) problems, which can be performed in a ...
New Versions of Bounded Real Lemmas for Continuous and Discrete Uncertain Systems
New bounded real lemmas for linear systems with parameter uncertainties belonging to a convex bounded-polyhedral domain are established in this paper. Both continuous- and discrete-time uncertain systems are investigated. The derived conditions are ...
Comments
Information & Contributors
Information
Published In
February 1990
270 pages
ISBN:0897913469
DOI:10.1145/323410
- Chairmen:
- Richard H. Austing,
- Lillian N. Cassel,
- Editors:
- James E. Miller,
- Daniel T. Joyce
Feb. 1990269 pagesISSN:0097-8418DOI:10.1145/319059Issue’s Table of Contents- Chairmen:
- Richard H. Austing,
- Lillian N. Cassel,
- Editors:
- James E. Miller,
- Daniel T. Joyce
Copyright © 1990 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 February 1990
Check for updates
Qualifiers
- Article
Conference
SIGCSE90
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,595 of 4,542 submissions, 35%
Upcoming Conference
SIGCSE Virtual 2024
- Sponsor:
- sigcse
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 1,195Total Downloads
- Downloads (Last 12 months)111
- Downloads (Last 6 weeks)13
Reflects downloads up to 26 Jul 2024
Other Metrics
Citations
Cited By
View all- Doczkal CSmolka G(2018)Regular Language Representations in the Constructive Type Theory of CoqJournal of Automated Reasoning10.1007/s10817-018-9460-x61:1-4(521-553)Online publication date: 1-Jun-2018
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in