Counterexamples for the Converse of the Pumping Lemma Computer Science |
- Counterexamples for the Converse of the Pumping Lemma
- Interactive and Visual Graph Theory Tutorials for quick learning.
- TSDBs at Scale – Part Two
- Is NordVPN really secure?
- Please comment if my new logic for adder is good...
| Counterexamples for the Converse of the Pumping Lemma Posted: 13 Aug 2018 08:56 PM PDT The pumping lemma for regular languages states that: "If L is a regular language, there exists a pumping length p such that for every string w in L that has length greater than or equal to p, w can be decomposed into substrings x, y, and z such that y is not empty, the length of xy is at most p, and the string xyiz is also in the regular language L." From what I understand, the converse of this statement does not hold true. However, I can't seem to grasp the intuition as to why this is the case; nor can I come up with any counterexamples myself. How could I possible construct a language that satisfies the pumping lemma but fails to be regular? [link] [comments]  |
| Interactive and Visual Graph Theory Tutorials for quick learning. Posted: 13 Aug 2018 07:46 AM PDT |
| Posted: 13 Aug 2018 07:22 AM PDT Posting on behalf of /u/stronglift_cyclist Here's the second half of our two-part series focusing on the challenges of Time Series Databases (TSDBs) at scale. This half focuses on the challenges of balancing read vs. write performance, data aggregation, large dataset analysis, and operational complexity in TSDBs. [link] [comments]  |
| Posted: 14 Aug 2018 02:03 AM PDT I started reading about online security recently. VPN seems like a good way to kinda hide your identity online. At least in front of the ISP. I checked some VPN services and NordVPN seems like the most popular choice. Is it really that secure? Is there something more I would need to check before committing to them? P.S. Sorry if that's not the right place to ask, just couldn't find more suitable subreddit [link] [comments]  |
| Please comment if my new logic for adder is good... Posted: 13 Aug 2018 05:29 AM PDT Paper on logic circuit of n binary numbers having k bits I present a new logic for adding up n binary numbers having k bits each in my above paper. It uses only a counter logic that adds up the number of 1's in a column with the carry and outputs the last digit as sum and the remainder as carry for the current column. For last column(from which iteration begins till 1st column), the carry is 0. For the 1st column it takes the whole output of the counter as the sum. Please suggest if this can be implemented much easily than FULL adder of HALF adder, and if it can be more efficient than using those. Also, if it can be implemented at all, that is, such a counter can be made or not as I am a newbie to electronics. Please note that you might need to download the paper as the document is currently being converted by Scribd at academia.edu whose link I have posted above, and it says the paper might be available to 'view' only soon, as I have recently uploaded it. [link] [comments]  |
| You are subscribed to email updates from Computer Science: Theory and Application. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
| Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States | |
No comments:
Post a Comment