LEADER 01259nam2-2200421---450- 001 990000429910203316 005 20050919130812.0 010 $a2-85939-307-2 035 $a0042991 035 $aUSA010042991 035 $a(ALEPH)000042991USA01 035 $a0042991 100 $a20010507d1990----km-y0itay0103----ba 101 $afre 102 $aFR 105 $a||||||||001yy 200 1 $aCommentaire$epremiere partie$fJean Bollack$v2 210 $aLille$cPresses universitaires de Lille$d1990 215 $a525 p.$d24 cm 225 2 $aCahiers de philologie$v12 410 $12001$aCahiers de philologie$v12 461 1$10010042986$12001$a<> Oedipe roi de Sophocle 606 0 $aSofocle$xEdipo re$xCommenti 676 $a882.01 700 1$aBOLLACK$bJean$045035 701 1$aSOPHOCLES$0439098 801 0$aIT$bsalbc$gISBD 912 $a990000429910203316 951 $aV.1.A. 117/2(II f B 460 2)$b107052 LM$cII f B 959 $aBK 969 $aUMA 979 $aPATTY$b90$c20010507$lUSA01$h1206 979 $aPATTY$b90$c20010507$lUSA01$h1207 979 $c20020403$lUSA01$h1651 979 $aPATRY$b90$c20040406$lUSA01$h1630 979 $aCOPAT3$b90$c20050919$lUSA01$h1308 996 $aCommentaire$9873817 997 $aUNISA LEADER 03544nam 2200625 a 450 001 9910788556603321 005 20230725045600.0 010 $a1-283-14488-3 010 $a9786613144881 010 $a981-4317-61-6 035 $a(CKB)3360000000001400 035 $a(EBL)731102 035 $a(OCoLC)741492797 035 $a(SSID)ssj0000632322 035 $a(PQKBManifestationID)12204942 035 $a(PQKBTitleCode)TC0000632322 035 $a(PQKBWorkID)10609496 035 $a(PQKB)10908022 035 $a(MiAaPQ)EBC731102 035 $a(WSP)00001164 035 $a(Au-PeEL)EBL731102 035 $a(CaPaEBR)ebr10480236 035 $a(CaONFJC)MIL314488 035 $a(EXLCZ)993360000000001400 100 $a20110713d2010 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, formal languages and algebraic systems$b[electronic resource] $eproceedings of AFLAS 2008, Kyoto, Japan, 20-22 September 2008 /$fedited by Masami Ito, Yuji Kobayashi, Kunitaka Shoji 210 $aSingapore ;$aHackensack, N.J. $cWorld Scientific Pub. Co.$d2010 215 $a1 online resource (250 p.) 300 $aDescription based upon print version of record. 311 $a981-4317-60-8 320 $aIncludes bibliographical references. 327 $aPreface; CONTENTS; Solidifyable Minimal Clone of Partial Operation S. Busaman and K. Denecke; A Novel Cryptosystem Based on Finite Automata Without Output P. Domosi; Linear Languages of Finite and In nite Words Z. Esik, M. Ito and W. Kuich; Extended Temporal Logics on Finite Words Z. Esik and Sz. Iv an; The Number of Distinct 4-Cycles and 2-Matchings of Some Zero-Divisor Graphs M. Kanemitsu; On Normal Form Grammars and Their Size A. Kelemenov a, L. Ciencialov a and L. Cienciala; Grobner Bases on Algebras Based on Well-Ordered Semigroups Y. Kobayashi 327 $aConcurrent Finite Automata and Related Language Classes M. Kudlek and G. ZetzscheFinitely Expandable Deep PDAs P. Leupold and A. Meduna; The Primitivity Distance of Words G. Lischke; Fine Convergence of Functions and Its E ectivization T. Mori, M. Yasugi and Y. Tsujii; On a Hierarchy of Permutation Languages B. Nagy; Derivation Trees for Context-Sensitive Grammars B. Nagy; On Proper Languages and Transformations of Lexicalized Types of Automata F. Otto; Initial Literal Shu es of Uniform Codes G. Tanaka and Y. Kunimochi 330 $aThis volume consists of papers selected from the presentations at the workshop and includes mainly recent developments in the fields of formal languages, automata theory and algebraic systems related to the theoretical computer science and informatics. It covers the areas such as automata and grammars, languages and codes, combinatorics on words, cryptosystems, logics and trees, Grobner bases, minimal clones, zero-divisor graphs, fine convergence of functions, and others. 606 $aMachine theory$vCongresses 606 $aFormal languages$vCongresses 615 0$aMachine theory 615 0$aFormal languages 676 $a511.3 701 $aIto?$b Masami$f1941-$0278611 701 $aKobayashi$b Yu?ji$01180805 701 $aShoji$b Kunitaka$01466137 712 12$aInternational Workshop on Automata, Formal Languages and Algebraic Systems 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910788556603321 996 $aAutomata, formal languages and algebraic systems$93676446 997 $aUNINA