Talk:Linear bounded automaton

External links modified

Hello fellow Wikipedians,

I have just modified 2 external links on Linear bounded automaton. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

• Added archive https://web.archive.org/web/20070205070159/http://www.cs.uky.edu/~lewis/texts/theory/automata/lb-auto.pdf to http://www.cs.uky.edu/~lewis/texts/theory/automata/lb-auto.pdf
• Added archive https://web.archive.org/web/20070109012311/http://www.cs.uky.edu/~lewis/ to http://www.cs.uky.edu/~lewis/

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

As of February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete the "External links modified" sections if they want, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{sourcecheck}} (last update: 15 July 2018).

• If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
• If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—InternetArchiveBot (Report bug) 18:45, 23 December 2017 (UTC)

Is the requirement that the string maps to shorter or equal or longer or equal string?

I'm confused by this: "The only restriction placed on grammars for such languages is that no production maps a string to a shorter string." I don't understand how does the conclusion "Thus no derivation of a string in a context-sensitive language can contain a sentential form longer than the string itself." follows. What the first says is that S -> SS | x is a valid LBA grammar, but this clearly maps S to SS, then to SSS, then to SSSS and so on. 141.226.245.164 (talk) 16:13, 15 January 2018 (UTC)

Yes, your example grammar is a valid context-sensitive grammar. - In your example, none of the sentential forms is shorter than any of its predecessors in your derivation chain. So where is your problem in this example? - Jochen Burghardt (talk) 18:13, 15 January 2018 (UTC)