LEADER 02237nam 2200385 n 450 001 996392289603316 005 20200824121803.0 035 $a(CKB)4940000000108177 035 $a(EEBO)2240961055 035 $a(UnM)99862932e 035 $a(UnM)99862932 035 $a(EXLCZ)994940000000108177 100 $a19930303d1653 uy | 101 0 $aeng 135 $aurbn||||a|bb| 200 10$aLieu. Col. John Lilburn's plea in law$b[electronic resource] $eagainst an Act of Parliament of the 30 of January, 1651. entituled, An act for the execution of a judgment given in Parliament against Lieu. Col. John Lilburn. Contrived and penned, on purpose for him, by a true and faithful lover of the fundamental laws and liberties of the free people of England, ... all which compels and forceth the penman to be very studious of his own good and preservation, ... and therefore, for his own good and benefit, the honest readers information, and for Mr Lilburns the prisoners advantage, he presents these ensuing lines to thy view, and his, as the form of a plea; that the penman hereof, as a true well-wisher of his, and the people of England, would have him to ingross into parchment, and to have ready by him to make use of (in case his own braines cannot contrive a better) when he is called up to answer for his life before the judges of the upper-bench, or any other bar of justice whatsoever; and the said form of a plea for him thus followeth verbatim 205 $aThe second edition much inlarged, corrected, and amended, July 2. 1653. 210 $a[London $cs.n.$d1653] 215 $a16 p 300 $aAttributed to Lilburn himself. 300 $aCaption title. 300 $aThe Act was passed in 1652. 300 $aPlace of publication from Wing. 300 $aReproduction of the original in the British Library. 330 $aeebo-0018 607 $aGreat Britain$xHistory$yCommonwealth and Protectorate 1649-1660$vEarly works to 1800 700 $aLilburne$b John$f1614?-1657.$01001077 801 0$bCu-RivES 801 1$bCu-RivES 801 2$bCStRLIN 801 2$bWaOLN 906 $aBOOK 912 $a996392289603316 996 $aLieu. Col. John Lilburn's plea in law$92397975 997 $aUNISA LEADER 04111nam 22008295 450 001 9910484379603321 005 20251226193559.0 010 $a3-319-18812-7 024 7 $a10.1007/978-3-319-18812-6 035 $a(CKB)3710000000416848 035 $a(SSID)ssj0001501383 035 $a(PQKBManifestationID)11830591 035 $a(PQKBTitleCode)TC0001501383 035 $a(PQKBWorkID)11524807 035 $a(PQKB)10334990 035 $a(DE-He213)978-3-319-18812-6 035 $a(MiAaPQ)EBC6306537 035 $a(MiAaPQ)EBC5587109 035 $a(Au-PeEL)EBL5587109 035 $a(OCoLC)909878080 035 $a(PPN)186029683 035 $a(EXLCZ)993710000000416848 100 $a20150514d2015 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCellular Automata and Discrete Complex Systems $e20th International Workshop, AUTOMATA 2014, Himeji, Japan, July 7-9, 2014, Revised Selected Papers /$fedited by Teijiro Isokawa, Katsunobu Imai, Nobuyuki Matsui, Ferdinand Peper, Hiroshi Umeo 205 $a1st ed. 2015. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2015. 215 $a1 online resource (XV, 149 p. 53 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8996 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-319-18811-9 320 $aIncludes bibliographical references and index. 327 $aComplexity of One-Way Cellular Automata -- Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles -- 5-State Rotation-Symmetric Number-Conserving Cellular Automata are not Strongly Universal -- A Universal Cellular Automaton Without Sensitive Subsystems -- Real-Time Reversible One-Way Cellular Automata -- Cycle Equivalence of Finite Dynamical Systems Containing Symmetries -- Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces -- Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results -- Rapaport Language Recognition by Reversible Partitioned Cellular Automata -- Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2 -- Plane-Walking Automata. 330 $aThis book constitutes revised selected papers from the 20th International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2014, held in Himeji, Japan, in July 2014. The 10 regular papers included in this volume were carefully reviewed and selected from a total of 25 submissions. It also contains one invited talk in full paper length. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8996 606 $aComputer science 606 $aAlgorithms 606 $aComputer simulation 606 $aComputer networks 606 $aArtificial intelligence$xData processing 606 $aTheory of Computation 606 $aAlgorithms 606 $aComputer Modelling 606 $aComputer Communication Networks 606 $aData Science 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aComputer simulation. 615 0$aComputer networks. 615 0$aArtificial intelligence$xData processing. 615 14$aTheory of Computation. 615 24$aAlgorithms. 615 24$aComputer Modelling. 615 24$aComputer Communication Networks. 615 24$aData Science. 676 $a511.3 702 $aIsokawa$b Teijiro$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aImai$b Katsunobu$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMatsui$b Nobuyuki$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPeper$b Ferdinand$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aUmeo$b Hiroshi$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484379603321 996 $aCellular Automata and Discrete Complex Systems$94183703 997 $aUNINA