LEADER 05559nam 2200721Ia 450 001 9910783920603321 005 20230617035722.0 010 $a1-281-90855-X 010 $a9786611908553 010 $a981-270-497-3 035 $a(CKB)1000000000334429 035 $a(EBL)296279 035 $a(OCoLC)476064785 035 $a(SSID)ssj0000273829 035 $a(PQKBManifestationID)11214888 035 $a(PQKBTitleCode)TC0000273829 035 $a(PQKBWorkID)10322845 035 $a(PQKB)10891182 035 $a(MiAaPQ)EBC296279 035 $a(WSP)00004959 035 $a(Au-PeEL)EBL296279 035 $a(CaPaEBR)ebr10173900 035 $a(EXLCZ)991000000000334429 100 $a20031203d2003 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aWords, languages, and combinatorics III$b[electronic resource] $eproceedings of the international conference : Kyoto, Japan, 14-18 March 2000 /$feditors, Masami Ito, Teruo Imaoka 210 $a[River Edge] New Jersey $cWorld Scientific$dc2003 215 $a1 online resource (503 p.) 300 $aHeld at the Kyoto Sangyo University. 300 $a"The Third International Colloquim on words, Languages and Combinatorics ..."--Preface. 311 $a981-02-4948-9 320 $aIncludes bibliographical references and index. 327 $aPreface; Scientific Program; List of Speakers; Table of Contents; Contributed Papers; Semidirect Products with the Pseudovariety of All Finite Groups J. Almeida (Porto, Portugal) and A. Escada (Coimbra, Portugal); On the Sentence Valuations in a Semiring A. Atanasiu (Bucharest, Romania), C. Martin- Vide (Tarragona, Spain) and V. Mitrana (Bucharest, Romania); Join Decompositions of Pseudovarieties of the Form DH ECom K. Auinger (Wien, Austria) 327 $aArithmetical Complexity of Infinite Words S. V. Avgustinovich (Novosibirsk, Russia), D. G. Fon-Der-Flaass (Novosibirsk, Russia) and A. E. Frid (Novosibirsk, Russia)The Emperor's New Recursiveness: The Epigraph of the Exponential Function in Two Models of Computability V. Brattka (Hagen, Germany); Iterative Arrays with Limited Nondeterministic Communication Cell T. Buchholz (Giessen, Germany), A. Klein (Giessen, Germany) and M. Kutrib (Giessen, Germany); R-Trivial Languages of Words on Countable Ordinals O. Carton (Marne-la- Vallee, France) 327 $aThe Theory of Rational Relations on Transfinite Strings C. Choflrut (Paris, France) and S. Grigorieff (Paris, France)Networks of Watson-Crick DOL Systems E. Csuhaj-Varjd (Budapest, Hungary) and A. Salomaa (Thrku, Finland); On the Differentiation Function of Some Language Generating Devices J. Dassow (Magdeburg, Germany); Visualization of Cellular Automata M. Deminy (Debrecen, Hungary), G. Horvath (Debrecen, Hungary), Cs. Nagylaki (Debrecen, Hungary) and 2. Nagylaki (Debrecen, Hungary); On a Class of Hypercodes Do Long Van (Hanoi, Vietnam) 327 $aA Parsing Problem for Context-Sensitive Languages P. Domosi (Debrecen, Hungary) and M. Ito (Kyoto, Japan)An Improvement of Iteration Lemmata for Context-Free Languages P. Domosi (Debrecen, Hungary) and M. Kudlek (Hamburg, Germany); Quantum Finite Automata J. Gruska (Brno, Czech Republic) and R. Vollmar (Karlsruhe, Germany); On Commutative Asynchronous Automata B. Imreh (Szeged, Hungary), M. Ito (Kyoto, Japan) and A. Pukler (Gyor, Hungary); Presentations of Right Unitary Submonoids of Monoids I. Inata (Funabashi, Japan) 327 $aA Combinatorial Property of Languages and Monoids A. V. Kelarev (Hobart, Australia) and P. G. Trotter (Hobart, Australia)Error-Detecting Properties of Languages S. Konstantinidis (Halifax, Canada); A Note on Finding One-Variable Patterns Consistent with Examples and Counterexamples T. Koshiba (Kawasaki, Japan) and K. Hiraishi (Ishikawa, Japan); On the Star Height of Rational Languages: A New Presentation for Two Old Results S. Lombardy (Paris, France) and J. Sakarovitch (Paris, France); Some Properties of Hyperoperations and Hyperclones H. Machida (Kunitachi, Japan) 327 $aWords Guaranteeing Minimal Image S. W. Margolis (Ramat Gan, Israel), J.-E. Pin (Paris, France) and M. V. Volkov (Ekaterinburg, Russia) 330 $aThe research results published in this book range from pure mathematical theory (semigroup theory, discrete mathematics, etc.) to theoretical computer science, in particular formal languages and automata. The papers address issues in the algebraic and combinatorial theories of semigroups, words and languages, the structure theory of automata, the classification theory of formal languages and codes, and applications of these theories to various areas, like quantum and molecular computing, coding theory, and cryptography. 517 3 $aWords, languages, and combinatorics 3 517 3 $aWords, languages, and combinatorics three 517 3 $aProceedings of the international conference, words, languages, and combinatorics III 606 $aSemigroups$vCongresses 606 $aFormal languages$vCongresses 606 $aMachine theory$vCongresses 615 0$aSemigroups 615 0$aFormal languages 615 0$aMachine theory 676 $a005.1 701 $aIto?$b Masami$f1941-$0278611 701 $aImaoka$b Teruo$01501737 712 02$aKyo?to Sangyo? Daigaku. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910783920603321 996 $aWords, languages, and combinatorics III$93729043 997 $aUNINA