LEADER 03831nam  2200649Ia 450 
001 9910784961303321
005 20230829003028.0
010   $a1-281-37321-4
010   $a9786611373214
010   $a981-277-303-7
035   $a(CKB)1000000000409879
035   $a(EBL)1679482
035   $a(OCoLC)879023650
035   $a(SSID)ssj0000157239
035   $a(PQKBManifestationID)11147387
035   $a(PQKBTitleCode)TC0000157239
035   $a(PQKBWorkID)10131686
035   $a(PQKB)11249473
035   $a(MiAaPQ)EBC1679482
035   $a(WSP)00006180
035   $a(Au-PeEL)EBL1679482
035   $a(CaPaEBR)ebr10201404
035   $a(CaONFJC)MIL137321
035   $a(EXLCZ)991000000000409879
100   $a20061103d2006      uy             0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 00$aFormal models, languages and applications$b[electronic resource] /$feditors, K.G. Subramanian, K. Rangarajan, M. Mukund
210   $aSingapore ;$aHackensack, NJ. $cWorld Scientific$dc2006
215   $a1 online resource (420 p.)
225 1 $aSeries in machine perception and artificial intelligence ;$vv. 66
300   $aDescription based upon print version of record.
311   $a981-256-889-1 
320   $aIncludes bibliographical references.
327   $tPreface$gCh. 1$tFinite Array Automata and Regular Array Grammars .--$g1$tIntroduction .--$g2$tPreliminaries.--$g3$tFinite Array Automata.--$g4$tRegular Array Languages and Pumping Lemma.--$g5$tControl on Regular Array grammars.--$g6$tFinal Remarks.--$tReferences$gCh. 2$tL-Convex Polyominoes: A Survey .--$g1$tIntroduction .--$g2$tDefinitions and Preliminaries on L-convex Polyominoes.--$g3$tDiscrete Tomography.--$g4$tL-convex Polyominoes with Respect to Subpicture Order.--$g5$tEnumerating L-Convex Polyominoes .--$tReferences$gCh. 3$tOn Oriented Labelling Parameters .--$g1$tIntroduction .--$g2$tOriented Vertex Partitioning Problems.--$g3$tNotation and Terminology .--$g4$tTwo Oriented Variations of L(p g)-Labelling.--$g5$tOriented L(p q)-Labelling for Trees.--$g6$tOriented L(p 1)-Labelling of Bipartite Graphs.--$g7$tOriented L(p 1)-Labelling and the Acyclic Chromatic Number .--$g8$tL(p q)-Labelling of Oriented Graphs.--$g9$tConclusion .--$tReferences$gCh. 4$tOn a Variant of Parallel Communicating Grammar Systems with Communication by Command .--$g1$tIntroduction .--$g2$tBasic Notions and Definitions.--$g3$tOn the Power of FCCPC Grammar Systems4 On the Efficiency of FCCPC Grammar Systems .--$g5$tFinal Remarks.--$tReferences$gCh. 5$tSome Remarks on Homogeneous Generating Networks of Free Evolutionary Processors.--$g1$tIntroduction .--$g2$tBasic Definitions.--$g3$tComputational Power of HGNFEPs.--$g4$tConclusion
330   $aA collection of articles by leading experts in theoretical computer science, this volume commemorates the 75th birthday of Professor Rani Siromoney, one of the pioneers in the field in India. The articles span the vast range of areas that Professor Siromoney has worked in or influenced, including grammar systems, picture languages and new models of computation.
410  0$aSeries in machine perception and artificial intelligence ;$vv. 66.
606   $aCompilers (Computer programs)
606   $aComputational complexity
606   $aFormal languages
615  0$aCompilers (Computer programs)
615  0$aComputational complexity.
615  0$aFormal languages.
676   $a004
701   $aMukund$b Madhavan$01552340
701   $aRangarajan$b K$01552341
701   $aSubramanian$b K. G$01552342
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910784961303321
996   $aFormal models, languages and applications$93812164
997   $aUNINA