Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Automata, formal languages and algebraic systems [[electronic resource] ] : proceedings of AFLAS 2008, Kyoto, Japan, 20-22 September 2008 / / edited by Masami Ito, Yuji Kobayashi, Kunitaka Shoji
| Automata, formal languages and algebraic systems [[electronic resource] ] : proceedings of AFLAS 2008, Kyoto, Japan, 20-22 September 2008 / / edited by Masami Ito, Yuji Kobayashi, Kunitaka Shoji |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, N.J., : World Scientific Pub. Co., 2010 |
| Descrizione fisica | 1 online resource (250 p.) |
| Disciplina | 511.3 |
| Altri autori (Persone) |
ItōMasami <1941->
KobayashiYūji ShojiKunitaka |
| Soggetto topico |
Machine theory
Formal languages |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-283-14488-3
9786613144881 981-4317-61-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; 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
Concurrent 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 |
| Record Nr. | UNINA-9910464237603321 |
| Singapore ; ; Hackensack, N.J., : World Scientific Pub. Co., 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata, formal languages and algebraic systems [[electronic resource] ] : proceedings of AFLAS 2008, Kyoto, Japan, 20-22 September 2008 / / edited by Masami Ito, Yuji Kobayashi, Kunitaka Shoji
| Automata, formal languages and algebraic systems [[electronic resource] ] : proceedings of AFLAS 2008, Kyoto, Japan, 20-22 September 2008 / / edited by Masami Ito, Yuji Kobayashi, Kunitaka Shoji |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, N.J., : World Scientific Pub. Co., 2010 |
| Descrizione fisica | 1 online resource (250 p.) |
| Disciplina | 511.3 |
| Altri autori (Persone) |
ItōMasami <1941->
KobayashiYūji ShojiKunitaka |
| Soggetto topico |
Machine theory
Formal languages |
| ISBN |
1-283-14488-3
9786613144881 981-4317-61-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; 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
Concurrent 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 |
| Record Nr. | UNINA-9910788556603321 |
| Singapore ; ; Hackensack, N.J., : World Scientific Pub. Co., 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata, formal languages and algebraic systems : proceedings of AFLAS 2008, Kyoto, Japan, 20-22 September 2008 / / edited by Masami Ito, Yuji Kobayashi, Kunitaka Shoji
| Automata, formal languages and algebraic systems : proceedings of AFLAS 2008, Kyoto, Japan, 20-22 September 2008 / / edited by Masami Ito, Yuji Kobayashi, Kunitaka Shoji |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, N.J., : World Scientific Pub. Co., 2010 |
| Descrizione fisica | 1 online resource (250 p.) |
| Disciplina | 511.3 |
| Altri autori (Persone) |
ItōMasami <1941->
KobayashiYūji ShojiKunitaka |
| Soggetto topico |
Machine theory
Formal languages |
| ISBN |
1-283-14488-3
9786613144881 981-4317-61-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; 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
Concurrent 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 |
| Record Nr. | UNINA-9910818249303321 |
| Singapore ; ; Hackensack, N.J., : World Scientific Pub. Co., 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Developments in Language Theory [[electronic resource] ] : 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008, Proceedings / / edited by Masami Ito, Masafumi Toyama
| Developments in Language Theory [[electronic resource] ] : 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008, Proceedings / / edited by Masami Ito, Masafumi Toyama |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XIII, 544 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Algorithms Computer science—Mathematics Discrete mathematics Formal Languages and Automata Theory Theory of Computation Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation |
| ISBN | 3-540-85780-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Iteration Semirings -- Various Aspects of Finite Quantum Automata -- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes -- Selected Ideas Used for Decidability and Undecidability of Bisimilarity -- The Frobenius Problem and Its Generalizations -- Well Quasi-orders in Formal Language Theory -- Contributed Papers -- On the Non-deterministic Communication Complexity of Regular Languages -- General Algorithms for Testing the Ambiguity of Finite Automata -- Emptiness of Multi-pushdown Automata Is 2ETIME-Complete -- The Average State Complexity of the Star of a Finite Set of Words Is Linear -- On the Computational Capacity of Parallel Communicating Finite Automata -- On a Generalization of Standard Episturmian Morphisms -- Universal Recursively Enumerable Sets of Strings -- Algorithmically Independent Sequences -- Relationally Periodic Sequences and Subword Complexity -- Bounds on Powers in Strings -- When Is Reachability Intrinsically Decidable? -- Some New Modes of Competence-Based Derivations in CD Grammar Systems -- The Synchronization Problem for Strongly Transitive Automata -- On the Decidability of the Equivalence for k-Valued Transducers -- Decidable Properties of 2D Cellular Automata -- Fixed Point and Aperiodic Tilings -- Extended Multi Bottom-Up Tree Transducers -- Derivation Tree Analysis for Accelerated Fixed-Point Computation -- Tree Automata with Global Constraints -- Bad News on Decision Problems for Patterns -- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time -- More Concise Representation of Regular Languages by Automata and Regular Expressions -- A Taxonomy of Deterministic Forgetting Automata -- Provably Shorter Regular Expressions from Deterministic Finite Automata -- Large Simple Binary Equality Words -- On the Relation between Periodicity and Unbordered Factors of Finite Words -- Duplication in DNA Sequences -- On the State Complexity of Complements, Stars, and Reversals of Regular Languages -- On the State Complexity of Operations on Two-Way Finite Automata -- On the Size Complexity of Rotating and Sweeping Automata -- An Analysis and a Reproof of Hmelevskii’s Theorem -- Hierarchies of Piecewise Testable Languages -- Construction of Tree Automata from Regular Expressions -- Balance Properties and Distribution of Squares in Circular Words -- MSO Logic for Unambiguous Shared-Memory Systems -- Complexity of Topological Properties of Regular ?-Languages. |
| Record Nr. | UNISA-996466117103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Developments in Language Theory : 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008, Proceedings / / edited by Masami Ito, Masafumi Toyama
| Developments in Language Theory : 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008, Proceedings / / edited by Masami Ito, Masafumi Toyama |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XIII, 544 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Algorithms Computer science—Mathematics Discrete mathematics Formal Languages and Automata Theory Theory of Computation Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation |
| ISBN | 3-540-85780-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Iteration Semirings -- Various Aspects of Finite Quantum Automata -- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes -- Selected Ideas Used for Decidability and Undecidability of Bisimilarity -- The Frobenius Problem and Its Generalizations -- Well Quasi-orders in Formal Language Theory -- Contributed Papers -- On the Non-deterministic Communication Complexity of Regular Languages -- General Algorithms for Testing the Ambiguity of Finite Automata -- Emptiness of Multi-pushdown Automata Is 2ETIME-Complete -- The Average State Complexity of the Star of a Finite Set of Words Is Linear -- On the Computational Capacity of Parallel Communicating Finite Automata -- On a Generalization of Standard Episturmian Morphisms -- Universal Recursively Enumerable Sets of Strings -- Algorithmically Independent Sequences -- Relationally Periodic Sequences and Subword Complexity -- Bounds on Powers in Strings -- When Is Reachability Intrinsically Decidable? -- Some New Modes of Competence-Based Derivations in CD Grammar Systems -- The Synchronization Problem for Strongly Transitive Automata -- On the Decidability of the Equivalence for k-Valued Transducers -- Decidable Properties of 2D Cellular Automata -- Fixed Point and Aperiodic Tilings -- Extended Multi Bottom-Up Tree Transducers -- Derivation Tree Analysis for Accelerated Fixed-Point Computation -- Tree Automata with Global Constraints -- Bad News on Decision Problems for Patterns -- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time -- More Concise Representation of Regular Languages by Automata and Regular Expressions -- A Taxonomy of Deterministic Forgetting Automata -- Provably Shorter Regular Expressions from Deterministic Finite Automata -- Large Simple Binary Equality Words -- On the Relation between Periodicity and Unbordered Factors of Finite Words -- Duplication in DNA Sequences -- On the State Complexity of Complements, Stars, and Reversals of Regular Languages -- On the State Complexity of Operations on Two-Way Finite Automata -- On the Size Complexity of Rotating and Sweeping Automata -- An Analysis and a Reproof of Hmelevskii’s Theorem -- Hierarchies of Piecewise Testable Languages -- Construction of Tree Automata from Regular Expressions -- Balance Properties and Distribution of Squares in Circular Words -- MSO Logic for Unambiguous Shared-Memory Systems -- Complexity of Topological Properties of Regular ?-Languages. |
| Record Nr. | UNINA-9910767511003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The mathematical foundation of informatics [[electronic resource] ] : proceedings of the conference, Hanoi, Vietnam, 25-28 October 1999 / / editors, Do Long Van, M. Ito
| The mathematical foundation of informatics [[electronic resource] ] : proceedings of the conference, Hanoi, Vietnam, 25-28 October 1999 / / editors, Do Long Van, M. Ito |
| Pubbl/distr/stampa | Singapore ; ; New Jersey, : World Scientific, c2005 |
| Descrizione fisica | 1 online resource (215 p.) |
| Disciplina | 004.01/51 |
| Altri autori (Persone) |
DoLong Van <1941->
ItōMasami <1941-> |
| Soggetto topico |
Information technology - Mathematics
Information science - Mathematics |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-37286-2
9786611372866 981-270-311-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Contents; On Growth Function of Petri Net and its Applications Pham Tra An; On an Infinite Hierarchy of Petri Net Languages Pham Tra A n and Pham Van Thao; Algorithms to Test Rational w-Codes Xavier Augros and Igor Litovsky; Distributed Random Walks for an Efficient Design of a Random Spanning Tree Hichem Baala and Marc Bui; Formal Concept Analysis and Rough Set Theory in Clustering Ho Tu Bao; A Simple Heuristic Method for the Min-Cut k-Balanced Partitioning Problem Lelia Blin and Ivan Lavallee; Longest Cycles and Restgraph in Maximal Non-Hamiltonian Graphs Vu Dinh Hoa
Deterministic and Nondeterministic Directable Automata Masami ItoWorst-Case Redundancy of Solid Codes Helmut Jiirgensen and Stavros Konstantinidis; Maximal Independent Sets in Certain Subword Orders Nguyen Huong Lam; Strong Recognition of Rational w-Languages Bertrand Le Saec, V. R. Dare and R. Siromoney; Some Results Concerning Covers in the Class of Multivalued Positive Boolean Dependencies Le Duc Minh, Vu Ngoc Loan and Nguyen Xuan Huy; A New Measure for Attribute Selection Do Tan Phong, Ho Thuan and Ha Quang Thuy The Complexity of Problems Defined by Boolean Circuits Steffen Reith and Klaus W. WagnerThe Rational Skimming Theorem Jacques Sakarovitch; A New Classification of Finite Simple Groups Wujie Shi and Seymour Lapschutz; Connectedness of Tetravalent Metacirculant Graphs with Non-Empty First Symbol Ngo Dac Tan and Tran Minh Tuoc; On the Relation between Maximum Entropy Principle and the Condition Independence Assumption in the Probabilistic Logic Ha Dang Cao Tung |
| Record Nr. | UNINA-9910451486403321 |
| Singapore ; ; New Jersey, : World Scientific, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The mathematical foundation of informatics [[electronic resource] ] : proceedings of the conference, Hanoi, Vietnam, 25-28 October 1999 / / editors, Do Long Van, M. Ito
| The mathematical foundation of informatics [[electronic resource] ] : proceedings of the conference, Hanoi, Vietnam, 25-28 October 1999 / / editors, Do Long Van, M. Ito |
| Pubbl/distr/stampa | Singapore ; ; New Jersey, : World Scientific, c2005 |
| Descrizione fisica | 1 online resource (215 p.) |
| Disciplina | 004.01/51 |
| Altri autori (Persone) |
DoLong Van <1941->
ItōMasami <1941-> |
| Soggetto topico |
Information technology - Mathematics
Information science - Mathematics |
| ISBN |
1-281-37286-2
9786611372866 981-270-311-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Contents; On Growth Function of Petri Net and its Applications Pham Tra An; On an Infinite Hierarchy of Petri Net Languages Pham Tra A n and Pham Van Thao; Algorithms to Test Rational w-Codes Xavier Augros and Igor Litovsky; Distributed Random Walks for an Efficient Design of a Random Spanning Tree Hichem Baala and Marc Bui; Formal Concept Analysis and Rough Set Theory in Clustering Ho Tu Bao; A Simple Heuristic Method for the Min-Cut k-Balanced Partitioning Problem Lelia Blin and Ivan Lavallee; Longest Cycles and Restgraph in Maximal Non-Hamiltonian Graphs Vu Dinh Hoa
Deterministic and Nondeterministic Directable Automata Masami ItoWorst-Case Redundancy of Solid Codes Helmut Jiirgensen and Stavros Konstantinidis; Maximal Independent Sets in Certain Subword Orders Nguyen Huong Lam; Strong Recognition of Rational w-Languages Bertrand Le Saec, V. R. Dare and R. Siromoney; Some Results Concerning Covers in the Class of Multivalued Positive Boolean Dependencies Le Duc Minh, Vu Ngoc Loan and Nguyen Xuan Huy; A New Measure for Attribute Selection Do Tan Phong, Ho Thuan and Ha Quang Thuy The Complexity of Problems Defined by Boolean Circuits Steffen Reith and Klaus W. WagnerThe Rational Skimming Theorem Jacques Sakarovitch; A New Classification of Finite Simple Groups Wujie Shi and Seymour Lapschutz; Connectedness of Tetravalent Metacirculant Graphs with Non-Empty First Symbol Ngo Dac Tan and Tran Minh Tuoc; On the Relation between Maximum Entropy Principle and the Condition Independence Assumption in the Probabilistic Logic Ha Dang Cao Tung |
| Record Nr. | UNINA-9910783915703321 |
| Singapore ; ; New Jersey, : World Scientific, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The mathematical foundation of informatics : proceedings of the conference, Hanoi, Vietnam, 25-28 October 1999 / / editors, Do Long Van, M. Ito
| The mathematical foundation of informatics : proceedings of the conference, Hanoi, Vietnam, 25-28 October 1999 / / editors, Do Long Van, M. Ito |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Singapore ; ; New Jersey, : World Scientific, c2005 |
| Descrizione fisica | 1 online resource (215 p.) |
| Disciplina | 004.01/51 |
| Altri autori (Persone) |
DoLong Van <1941->
ItōMasami <1941-> |
| Soggetto topico |
Information technology - Mathematics
Information science - Mathematics |
| ISBN |
1-281-37286-2
9786611372866 981-270-311-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Contents; On Growth Function of Petri Net and its Applications Pham Tra An; On an Infinite Hierarchy of Petri Net Languages Pham Tra A n and Pham Van Thao; Algorithms to Test Rational w-Codes Xavier Augros and Igor Litovsky; Distributed Random Walks for an Efficient Design of a Random Spanning Tree Hichem Baala and Marc Bui; Formal Concept Analysis and Rough Set Theory in Clustering Ho Tu Bao; A Simple Heuristic Method for the Min-Cut k-Balanced Partitioning Problem Lelia Blin and Ivan Lavallee; Longest Cycles and Restgraph in Maximal Non-Hamiltonian Graphs Vu Dinh Hoa
Deterministic and Nondeterministic Directable Automata Masami ItoWorst-Case Redundancy of Solid Codes Helmut Jiirgensen and Stavros Konstantinidis; Maximal Independent Sets in Certain Subword Orders Nguyen Huong Lam; Strong Recognition of Rational w-Languages Bertrand Le Saec, V. R. Dare and R. Siromoney; Some Results Concerning Covers in the Class of Multivalued Positive Boolean Dependencies Le Duc Minh, Vu Ngoc Loan and Nguyen Xuan Huy; A New Measure for Attribute Selection Do Tan Phong, Ho Thuan and Ha Quang Thuy The Complexity of Problems Defined by Boolean Circuits Steffen Reith and Klaus W. WagnerThe Rational Skimming Theorem Jacques Sakarovitch; A New Classification of Finite Simple Groups Wujie Shi and Seymour Lapschutz; Connectedness of Tetravalent Metacirculant Graphs with Non-Empty First Symbol Ngo Dac Tan and Tran Minh Tuoc; On the Relation between Maximum Entropy Principle and the Condition Independence Assumption in the Probabilistic Logic Ha Dang Cao Tung |
| Record Nr. | UNINA-9910812475203321 |
| Singapore ; ; New Jersey, : World Scientific, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Words, languages, and combinatorics III [[electronic resource] ] : proceedings of the international conference : Kyoto, Japan, 14-18 March 2000 / / editors, Masami Ito, Teruo Imaoka
| Words, languages, and combinatorics III [[electronic resource] ] : proceedings of the international conference : Kyoto, Japan, 14-18 March 2000 / / editors, Masami Ito, Teruo Imaoka |
| Pubbl/distr/stampa | [River Edge] New Jersey, : World Scientific, c2003 |
| Descrizione fisica | 1 online resource (503 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
ItōMasami <1941->
ImaokaTeruo |
| Soggetto topico |
Semigroups
Formal languages Machine theory |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-90855-X
9786611908553 981-270-497-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; 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)
Arithmetical 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) The 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) A 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) A 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) Words Guaranteeing Minimal Image S. W. Margolis (Ramat Gan, Israel), J.-E. Pin (Paris, France) and M. V. Volkov (Ekaterinburg, Russia) |
| Altri titoli varianti |
Words, languages, and combinatorics 3
Words, languages, and combinatorics three Proceedings of the international conference, words, languages, and combinatorics III |
| Record Nr. | UNINA-9910451518803321 |
| [River Edge] New Jersey, : World Scientific, c2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Words, languages, and combinatorics III [[electronic resource] ] : proceedings of the international conference : Kyoto, Japan, 14-18 March 2000 / / editors, Masami Ito, Teruo Imaoka
| Words, languages, and combinatorics III [[electronic resource] ] : proceedings of the international conference : Kyoto, Japan, 14-18 March 2000 / / editors, Masami Ito, Teruo Imaoka |
| Pubbl/distr/stampa | [River Edge] New Jersey, : World Scientific, c2003 |
| Descrizione fisica | 1 online resource (503 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
ItōMasami <1941->
ImaokaTeruo |
| Soggetto topico |
Semigroups
Formal languages Machine theory |
| ISBN |
1-281-90855-X
9786611908553 981-270-497-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; 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)
Arithmetical 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) The 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) A 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) A 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) Words Guaranteeing Minimal Image S. W. Margolis (Ramat Gan, Israel), J.-E. Pin (Paris, France) and M. V. Volkov (Ekaterinburg, Russia) |
| Altri titoli varianti |
Words, languages, and combinatorics 3
Words, languages, and combinatorics three Proceedings of the international conference, words, languages, and combinatorics III |
| Record Nr. | UNINA-9910783920603321 |
| [River Edge] New Jersey, : World Scientific, c2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
