{"batchcomplete":"","query":{"logevents":[{"logid":4,"ns":0,"title":"Die Klasse NP","pageid":0,"logpage":19,"params":{},"type":"delete","action":"delete","user":"Css","timestamp":"2018-08-24T13:31:43Z","comment":"Inhalt war: \u201eEs gibt mehrere M\u00f6glichkeiten, auch f\u00fcr Turingmaschinen, analog zu Automaten, Nichtdeterminismus zu definieren. Wir nutzen hierzu eine relativ ei\u2026\u201c. Einziger Bearbeiter: [[Special:Contributions/Css|Css]] ([[User talk:Css|Diskussion]])"},{"logid":3,"ns":0,"title":"Abschlusseigenschaften von deterministischen endlichen Automaten","pageid":0,"logpage":4,"params":{},"type":"delete","action":"delete","user":"Css","timestamp":"2018-08-01T17:06:05Z","comment":"Inhalt war: \u201eWir wollen uns nun damit besch\u00e4ftigen, welche Sprachen deterministische endliche Automaten erkennen k\u00f6nnen.  == Die leere Sprache ==  Der Automat\u2026\u201c. Einziger Bearbeiter: [[Special:Contributions/Css|Css]] ([[User talk:Css|Diskussion]])"},{"logid":2,"ns":6,"title":"Datei:Logo.svg.png","pageid":7,"logpage":7,"params":{"img_sha1":"mcwyxk33y9sol9m8nqtoj3bxv73plyf","img_timestamp":"2018-07-27T13:33:56Z"},"type":"upload","action":"upload","user":"Jana","timestamp":"2018-07-27T13:33:56Z","comment":""},{"logid":1,"ns":2,"title":"Benutzer:Jana","pageid":0,"logpage":0,"params":{"userid":2},"type":"newusers","action":"create2","user":"Css","timestamp":"2018-07-21T15:23:23Z","comment":""}]}}