简体繁体 English

如何为 { x#y | 构建 PushDown 自动机 x, y ∈ {0,1}* 和 x≠y }？

[英]How can I construct PushDown automata for { x#y | x, y ∈ {0,1}* and x≠y }?

原文 2017-01-05 17:01:02 9 1 computation-theory/ pushdown-automaton/ automata-theory

Can anyone explain why this is a context free language and how to construct push down automata for this?谁能解释为什么这是一种上下文无关语言以及如何为此构建下推自动机？ I have found solution on linkSolution But I am unable to understand the language.我在链接解决方案上找到了解决方案但我无法理解该语言。

1 个解决方案

enter image description here在此处输入图像描述

In this way we can solve this problem这样我们就可以解决这个问题

我可以将两个符号推入下推自动机的堆栈吗？ - can i push two symbols to the stack of a pushdown automata?

如何构造 L={a^nb^m where n<=m<=2n} 的下推自动机？ - How to construct a pushdown automata for L={a^nb^m where n<=m<=2n}?

下推自动机和算术表达式 - pushdown automata and arithmetic expressions

为 L={a^mb^n 其中 n<=m<=2n} 构造一个下推自动机？ - construct a pushdown automata for L={a^mb^n where n<=m<=2n}?

如何创建一个接受语言的下推自动机？ - How to create a pushdown automata which accepts a language?

想知道下推自动机解决方案是否正确 - wondering if pushdown automata solution is correct

{ x£ { 0,1 } *| ∉ { 01,10 } * } 证明它是否是正则语言 - { x£ { 0,1 } *| ∉ { 01,10 } * } prove that it is a regular language or not

为什么不能使用下推自动机（PDA）定义以下语言？ - Why the following language cannot be defined using a Pushdown Automata (PDA)?

L = a^nb^n 的确定性下推自动机 | n >=0) Python 程序 - Deterministic Pushdown Automata for L = a^nb^n | n >=0) Python Program

如何显示{w | M_w接受0x且接受1x}语言不是递归语言？ - How do I show that the language {w|M_w accepts 0x iff it accepts 1x} is not recursive?

暂无

暂无

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

相关问题 我可以将两个符号推入下推自动机的堆栈吗？ - can i push two symbols to the stack of a pushdown automata? 如何构造 L={a^nb^m where n<=m<=2n} 的下推自动机？ - How to construct a pushdown automata for L={a^nb^m where n<=m<=2n}? 下推自动机和算术表达式 - pushdown automata and arithmetic expressions 为 L={a^mb^n 其中 n<=m<=2n} 构造一个下推自动机？ - construct a pushdown automata for L={a^mb^n where n<=m<=2n}? 如何创建一个接受语言的下推自动机？ - How to create a pushdown automata which accepts a language? 想知道下推自动机解决方案是否正确 - wondering if pushdown automata solution is correct { x£ { 0,1 } *| ∉ { 01,10 } * } 证明它是否是正则语言 - { x£ { 0,1 } *| ∉ { 01,10 } * } prove that it is a regular language or not 为什么不能使用下推自动机（PDA）定义以下语言？ - Why the following language cannot be defined using a Pushdown Automata (PDA)? L = a^nb^n 的确定性下推自动机 | n >=0) Python 程序 - Deterministic Pushdown Automata for L = a^nb^n | n >=0) Python Program 如何显示{w | M_w接受0x且接受1x}语言不是递归语言？ - How do I show that the language {w|M_w accepts 0x iff it accepts 1x} is not recursive?

相关标签

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