Timeline for How to prove that context sensitive languages are closed under intersection and complement?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 13, 2013 at 13:02 | comment | added | arty | @Jan just wasn't sure what meant by the word "model" - now i understand it is the representation model of the CSL. just to inform you, there is no other place on the web when this information available. I think your input will help a lot of computer science students and postgraduates (like me) who'd like to get some extra knowledge | |
| Oct 12, 2013 at 22:41 | comment | added | Hendrik Jan | @arty As you know CSL can be defined using context-sensitive grammars or by linear bounded automata. For some tasks the choice of the model is crucial. I like LBA because they are easy to "program". | |
| Oct 12, 2013 at 21:10 | comment | added | arty | Thanks you very much, now when i have this reference i will search for books. can you explain what you mean by "right model for the context sensitive languages" for doing yourself proof? | |
| Oct 12, 2013 at 21:07 | vote | accept | arty | ||
| Oct 12, 2013 at 12:57 | history | answered | Hendrik Jan | CC BY-SA 3.0 |