简体繁体 English

是a ^ n，其中n> 1000是常规语言吗？

[英]Is a^n, where n>1000 a regular language?

原文 2015-09-29 17:09:17 3 1 computer-science/ regular-language

As in the topic, if I have a language with alphabet {a}, does a^n, where n > 1000 a regular language? 就像在主题中一样，如果我有一种字母为{a}的语言，那么a ^ n是n> 1000的常规语言吗？ I am confused. 我很困惑。 I tried to apply the Pumping Lemma here, and I am unsure of the result. 我尝试在此处应用抽水引理，但不确定结果。 From one side I can see that if I pump out from a^1001 one of a's, then I will have a^1000 which does not belong to L. On the other side I couldn't find any examples of such cases, so maybe my reasoning is wrong. 从一侧我可以看到，如果我从a的1001中抽取一个a，那么我将拥有一个不属于L的a1000。另一方面，我找不到此类情况的任何示例，所以也许我的推理是错误的。

1 个解决方案

It's regular. 这是正常的。 Consider the regular expression a{1001}a* where a{1001} is a string of 1001 a 's. 考虑正则表达式a{1001}a* ，其中a{1001}是1001 a的字符串。

证明形式为0 ^ n（其中n为素数）的语言既不是常规语言也不是上下文无关语言 - prooving that a language of form 0^n where n is prime is neither regular nor context free

L = {a^na^nb^m |m, n ≥ 0} 是规则语言还是不规则语言？ - Is L = {a^n a^n b^m |m, n ≥ 0} a regular or irregular language?

这是语法{a ^ nb ^ 2n | n> = 0}是否正常？ - Is this grammar {a^n b^2n | n >= 0} regular or not?

语言A = {0 ^ n 1 ^ n 0 ^ n}是否上下文无关？ - Is the language A = {0^n 1^n 0^n} context free?

为什么是 {a^nb^n | n >= 0} 不规则？ - Why is {a^nb^n | n >= 0} not regular?

什么是语言a ^ mb ^ n的PDA（下推式自动机），其中n <m - What would be the PDA (pushdown automata) of the language a^mb^n where n<m

为什么是 {a^nb^n | n <= 10} 常规？ - Why is {a^nb^n | n <= 10} regular?

如果L = {0 ^ n 1 ^ n | n> 0} L ^ c（L的补码）是否规则？ - If L = {0^n 1^n | n > 0 } is L^c (complement of L) regular?

是语言{0 ^ n 1 ^ n 0 ^ k | k！= n}上下文免费？ - Is the language {0^n 1^n 0^k | k != n} context free?

L1 = {a ^ n b ^ n | n <4}且L2 = {a ^ n b ^ n | n <10 ^ 10 ^ 10}，常规语言？ - Are L1 = {a^n b^n | n < 4 } and L2 = {a^n b^n | n < 10^10^10 }, regular languages?

暂无

暂无

声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

相关问题 证明形式为0 ^ n（其中n为素数）的语言既不是常规语言也不是上下文无关语言 - prooving that a language of form 0^n where n is prime is neither regular nor context free L = {a^na^nb^m |m, n ≥ 0} 是规则语言还是不规则语言？ - Is L = {a^n a^n b^m |m, n ≥ 0} a regular or irregular language? 这是语法{a ^ nb ^ 2n | n> = 0}是否正常？ - Is this grammar {a^n b^2n | n >= 0} regular or not? 语言A = {0 ^ n 1 ^ n 0 ^ n}是否上下文无关？ - Is the language A = {0^n 1^n 0^n} context free? 为什么是 {a^nb^n | n >= 0} 不规则？ - Why is {a^nb^n | n >= 0} not regular? 什么是语言a ^ mb ^ n的PDA（下推式自动机），其中n <m - What would be the PDA (pushdown automata) of the language a^mb^n where n<m 为什么是 {a^nb^n | n <= 10} 常规？ - Why is {a^nb^n | n <= 10} regular? 如果L = {0 ^ n 1 ^ n | n> 0} L ^ c（L的补码）是否规则？ - If L = {0^n 1^n | n > 0 } is L^c (complement of L) regular? 是语言{0 ^ n 1 ^ n 0 ^ k | k！= n}上下文免费？ - Is the language {0^n 1^n 0^k | k != n} context free? L1 = {a ^ n b ^ n | n <4}且L2 = {a ^ n b ^ n | n <10 ^ 10 ^ 10}，常规语言？ - Are L1 = {a^n b^n | n < 4 } and L2 = {a^n b^n | n < 10^10^10 }, regular languages?

相关标签

粤ICP备18138465号 © 2020-2024 STACKOOM.COM