Screen LibraryWords, languages, and combinatorics III : proceedings of the international conference : Kyoto, Japan, 14-18 March 2000 /
The 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...
Saved in:
| Corporate Authors: | ; |
|---|---|
| Group Author: | ; |
| Published: |
World Scientific Pub. Co.,
|
| Publisher Address: | Singapore ; River Edge, N.J. : |
| Publication Dates: | 2003. |
| Literature type: | eBook |
| Language: | English |
| Subjects: | |
| Online Access: |
http://www.worldscientific.com/worldscibooks/10.1142/4959#t=toc |
| Summary: |
The 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. |
| Item Description: | "The Third International Colloquium on Words, Languages and Combinatorics was held at Kyoto Sangyo University from March 14 to 18, 2000."--Preface. |
| Carrier Form: | 1 online resource (xxiv,477pages) : illustrations |
| Bibliography: | Includes bibliographical references and index. |
| ISBN: | 9789812704979 (electronic bk.) |
| CLC: | O15-532 |
| Contents: | Semidirect products with the pseudovariety of all finite groups / J. Almeida and A. Escada -- On the sentence valuations in a semiring / A. Atanasiu, C. Martin-Vide and V. Mitrana -- Join decompositions of pseudovarieties of the form DH [symbol] ECom / K. Auinger -- Arithmetical complexity of infinite words / S.V. Avgustinovich, D.G. Fon-Der-Flaass and A.E. Frid -- The emperor's new recursiveness: the epigraph of the exponential function in two models of computability / V. Brattka -- Iterative arrays with limited nondeterministic communication cell / T. Buchholz, A. Klein and M. Kutrib -- R-trivial languages of words on countable ordinals / O. Carton -- The theory of rational relations on transfinite strings / C. Choffrut and S. Grigorieff -- Networks of Watson-Crick D0L systems / E. Csuhaj- Varj and A. Salomaa -- On the differentiation function of some language generating devices / J. Dassow -- Visualization of cellular automata / M. Dem ny ... [et al.] -- On a class of hypercodes / Do Long Van -- A parsing problem for context-sensitive languages / P. D m si and M. Ito -- An improvement of iteration lemmata for context-free languages / P. D m si and M. Kudlek -- Quantum finite automata / J. Gruska and R. Vollmar -- On commutative asynchronous automata / B. Imreh, M. Ito and A. Pukler -- Presentations of right unitary submonoids of monoids / I. Inata -- A combinatorial property of languages and monoids / A.V. Kelarev and P.G. Trotter -- Error-detecting properties of languages / S. Konstantinidis -- A note on finding one-variable patterns consistent with examples and counterexamples / T. Koshiba and K. Hiraishi -- On the star height of rational languages: a new presentation for two old results / S. Lombardy and J. Sakarovitch -- Some properties of hyperoperations and hyperclones / H. Machida -- Words guaranteeing minimal image / S.W. Margolis, J.-E. Pin and M.V. Volkov -- Power semigroups and polynomial closure / S.W. Margolis and B. Steinberg -- Routes and trajectories / A. Mateescu -- Characterization of valuation rings and valuation semigroups by semistar-operations / R. Matsuda -- Further results on restarting automata / G. Niemann and F. Otto -- Cellular automata with polynomials over finite fields / H. Nishio -- Generalized directable automata / Z. Popovi ... [et al.] -- Acts over right, left regular bands and semilattices types / T. Saito -- Two optimal parallel algorithms on the commutation class of a word / R. Schott and J.-C. Spehner -- A proof of Okni ski and Putcha's theorem / K. Shoji -- Subdirect product structure of left Clifford semigroups / K.P. Shum, M.K. Sen and Y.Q. Guo -- Tree automata in the theory of term rewriting / M. Steinby -- Key agreement protocol securer than DLOG / A. Yamamura and K. Kurosawa -- A note on rademacher functions and computability / M. Yasugi and M. Washihara. |