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.
2.:Applications to Recognizability and Decidability / Michel Rigo
| 2.:Applications to Recognizability and Decidability / Michel Rigo |
| Autore | RIGO, Michel |
| Pubbl/distr/stampa | London, : ISTE |
| Descrizione fisica | Testo elettronico (PDF) (XIX, 245 p.) |
| Disciplina | 001.642 |
| Collana | Networks and Telecommunications Series |
| Soggetto topico |
Computer programming
Formal languages Machine theory |
| ISBN | 9781119042853 |
| Formato | Risorse elettroniche  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996451649603316 |
| RIGO, Michel | ||
| London, : ISTE | ||
| Risorse elettroniche | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algebraic theory of automata and languages [[electronic resource] /] / Masami Ito
| Algebraic theory of automata and languages [[electronic resource] /] / Masami Ito |
| Autore | Itō Masami <1941-> |
| Pubbl/distr/stampa | River Edge, N.J., : World Scientific, 2004 |
| Descrizione fisica | 1 online resource (210 p.) |
| Disciplina | 511.3 |
| Soggetto topico |
Formal languages
Machine theory |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-87255-5
9786611872557 981-256-268-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algebraic Theory of Automata and Languages; Preface; Contents; 0 Introduction; 1 Group-Matrix Type Automata; 2 General Automata; 3 Classes of Automata as Posets; 4 Languages and Operations; 5 Shuffle Closed Languages; 6 Insertions and Deletions; 7 Shuffles and Scattered Deletions; 8 Directable Automata; Bibliography; Index |
| Record Nr. | UNINA-9910450123003321 |
Itō Masami <1941->
|
||
| River Edge, N.J., : World Scientific, 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algebraic theory of automata and languages [[electronic resource] /] / Masami Ito
| Algebraic theory of automata and languages [[electronic resource] /] / Masami Ito |
| Autore | Itō Masami <1941-> |
| Pubbl/distr/stampa | River Edge, N.J., : World Scientific, 2004 |
| Descrizione fisica | 1 online resource (210 p.) |
| Disciplina | 511.3 |
| Soggetto topico |
Formal languages
Machine theory |
| ISBN |
1-281-87255-5
9786611872557 981-256-268-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algebraic Theory of Automata and Languages; Preface; Contents; 0 Introduction; 1 Group-Matrix Type Automata; 2 General Automata; 3 Classes of Automata as Posets; 4 Languages and Operations; 5 Shuffle Closed Languages; 6 Insertions and Deletions; 7 Shuffles and Scattered Deletions; 8 Directable Automata; Bibliography; Index |
| Record Nr. | UNINA-9910783224303321 |
|
Itō Masami <1941->
|
||
| River Edge, N.J., : World Scientific, 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algebraic theory of automata and languages / / Masami Ito
| Algebraic theory of automata and languages / / Masami Ito |
| Autore | Itō Masami <1941-> |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | River Edge, N.J., : World Scientific, 2004 |
| Descrizione fisica | 1 online resource (210 p.) |
| Disciplina | 511.3 |
| Soggetto topico |
Formal languages
Machine theory |
| ISBN |
9786611872557
9781281872555 1281872555 9789812562685 9812562680 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algebraic Theory of Automata and Languages; Preface; Contents; 0 Introduction; 1 Group-Matrix Type Automata; 2 General Automata; 3 Classes of Automata as Posets; 4 Languages and Operations; 5 Shuffle Closed Languages; 6 Insertions and Deletions; 7 Shuffles and Scattered Deletions; 8 Directable Automata; Bibliography; Index |
| Record Nr. | UNINA-9910953583103321 |
|
Itō Masami <1941->
|
||
| River Edge, N.J., : World Scientific, 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Anaphora in natural language understanding : a survey / Graeme Hirst
| Anaphora in natural language understanding : a survey / Graeme Hirst |
| Autore | Hirst, Graeme |
| Pubbl/distr/stampa | Berlin : Springer-Verlag, 1981 |
| Descrizione fisica | xiii, 128 p. ; 25 cm. |
| Disciplina |
001
415 |
| Soggetto topico |
Anaphora (Linguistics)
Discourse analysis Formal languages |
| ISBN | 3540108580 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991000685279707536 |
|
Hirst, Graeme
|
||
| Berlin : Springer-Verlag, 1981 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Automata theory and formal languages : fundamental notions, theorems, and techniques / / Alberto Pettorossi
| Automata theory and formal languages : fundamental notions, theorems, and techniques / / Alberto Pettorossi |
| Autore | Pettorossi Alberto |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer International Publishing, , [2022] |
| Descrizione fisica | 1 online resource (287 pages) |
| Disciplina | 004.019 |
| Collana | Undergraduate Topics in Computer Science |
| Soggetto topico |
Human-computer interaction
Formal languages |
| ISBN |
9783031119651
9783031119644 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996485668803316 |
|
Pettorossi Alberto
|
||
| Cham, Switzerland : , : Springer International Publishing, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
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, languages and programming : 26th International Colloquium, ICALP'99, Prague, Czech Republik, July 11-15, 1999 : proceedings / / JiriÌ Wiedermann, Peter van Emde Boas, Mogens Nielsen (editors)
| Automata, languages and programming : 26th International Colloquium, ICALP'99, Prague, Czech Republik, July 11-15, 1999 : proceedings / / JiriÌ Wiedermann, Peter van Emde Boas, Mogens Nielsen (editors) |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin : , : Springer, , [1999] |
| Descrizione fisica | 1 online resource (XIV, 726 p.) |
| Disciplina | 005.13 |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Programming languages (Electronic computers)
Machine theory Formal languages |
| ISBN | 3-540-48523-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Generating Hard Instances of the Short Basis Problem -- Wide Area Computation -- Proof Techniques for Cryptographic Protocols -- Type Structure for Low-Level Programming Languages -- Real Computations with Fake Numbers -- A Model for Associative Memory, a Basis for Thinking and Consciousness -- Numerical Integration with Exact Real Arithmetic -- Observations about the Nature and State of Computer Science -- DNA Computing: New Ideas and Paradigms -- Online Data Structures in External Memory -- From Computational Learning Theory to Discovery Science -- Contributed Papers -- Bounded Depth Arithmetic Circuits: Counting and Closure -- Parametric Temporal Logic for “Model Measuring” -- Communicating Hierarchical State Machines -- Small Pseudo-Random Sets Yield Hard Functions: New Tight Explicit Lower Bounds for Branching Programs -- General Morphisms of Petri Nets (Extended Abstract) -- On Some Tighter Inapproximability Results (Extended Abstract) -- Decomposition and Composition of Timed Automata -- New Applications of the Incompressibility Method (Extended Abstract) -- Mobility Types for Mobile Ambients -- Protein Folding, the Levinthal Paradox and Rapidly Mixing Markov Chains -- Decidable Fragments of Simultaneous Rigid Reachability -- Text Compression Using Antidictionaries -- Non-interactive Zero-Knowledge: A Low-Randomness Characterization of NP (Extended Abstract) -- Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem -- Space-Time Tradeoffs for Graph Properties -- Boundedness of Reset P/T Nets -- Two-way finite state transducers and monadic second-order logic -- Partially Ordered Regular Languages for Graph Queries -- Deciding First-Order Properties of Locally Tree-Decomposable Graphs -- Comparison of Process Algebra Equivalences Using Formats -- Compact Routing Tables for Graphs of Bounded Genus (Extended Abstract) -- Computing LOGCFL Certificates -- Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (Extended Abstract) -- On the Complements of Partial k-Trees -- Approximation Results for Kinetic Variants of TSP -- Distributed Probabilistic Polling and Applications to Proportionate Agreement -- Bisimulation Equivalence Is Decidable for Normed Process Algebra (Extended abstract) -- A Framework for Decidable Metrical Logics -- On the Power of Las Vegas II. Two-Way Finite Automata -- Stable Marriage with Incomplete Lists and Ties -- Average-Case Complexity of Shellsort (Preliminary Version) -- Linear-Time Construction of Two-Dimensional Suffix Trees (Extended Abstract) -- A Connection between the Star Problem and the Finite Power Property in Trace Monoids (Extended Abstract) -- Two Techniques in the Area of the Star Problem -- Approximations by OBDDs and the Variable Ordering Problem -- Simulation Preorder on Simple Process Algebras -- Solos in Concert -- Shortest Anisotropic Paths on Terrains -- Relations between Local and Global Periodicity of Words (Extended Abstract) -- Efficient Merging, Construction, and Maintenance of Evolutionary Trees -- Formalizing a Lazy Substitution Proof System for ?-Calculus in the Calculus of Inductive Constructions -- Leader Election by d Dimensional Cellular Automata -- New Upper Bounds for MaxSat -- Polynomial and Rational Evaluation and Interpolation (with Structured Matrices) ? -- Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time -- Finite Automata with Generalized Acceptance Criteria -- A Variant of the Arrow Distributed Directory with Low Average Complexity (Extended Abstract) -- Closed Freyd- and ?-categories -- Typed Exceptions and Continuations Cannot Macro-Express Each Other -- Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously (Extended Abstract) -- Accessing Multiple Sequences Through Set Associative Caches -- T(A) = T(B)? -- Many-Valued Logics and Holographic Proofs -- On the Complexity and Inapproximability of Shortest Implicant Problems -- The Wave Propagator Is Turing Computable -- An FPTAS for Agreeably Weighted Variance on a Single Machine (Extended Abstract) -- Erratum: Bulk-Synchronous Parallel Multiplication of Boolean Matrices. |
| Record Nr. | UNINA-9910143456003321 |
| Berlin : , : Springer, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata, languages and programming : 26th International Colloquium, ICALP'99, Prague, Czech Republik, July 11-15, 1999 : proceedings / / JiriÌ Wiedermann, Peter van Emde Boas, Mogens Nielsen (editors)
| Automata, languages and programming : 26th International Colloquium, ICALP'99, Prague, Czech Republik, July 11-15, 1999 : proceedings / / JiriÌ Wiedermann, Peter van Emde Boas, Mogens Nielsen (editors) |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin : , : Springer, , [1999] |
| Descrizione fisica | 1 online resource (XIV, 726 p.) |
| Disciplina | 005.13 |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Programming languages (Electronic computers)
Machine theory Formal languages |
| ISBN | 3-540-48523-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Generating Hard Instances of the Short Basis Problem -- Wide Area Computation -- Proof Techniques for Cryptographic Protocols -- Type Structure for Low-Level Programming Languages -- Real Computations with Fake Numbers -- A Model for Associative Memory, a Basis for Thinking and Consciousness -- Numerical Integration with Exact Real Arithmetic -- Observations about the Nature and State of Computer Science -- DNA Computing: New Ideas and Paradigms -- Online Data Structures in External Memory -- From Computational Learning Theory to Discovery Science -- Contributed Papers -- Bounded Depth Arithmetic Circuits: Counting and Closure -- Parametric Temporal Logic for “Model Measuring” -- Communicating Hierarchical State Machines -- Small Pseudo-Random Sets Yield Hard Functions: New Tight Explicit Lower Bounds for Branching Programs -- General Morphisms of Petri Nets (Extended Abstract) -- On Some Tighter Inapproximability Results (Extended Abstract) -- Decomposition and Composition of Timed Automata -- New Applications of the Incompressibility Method (Extended Abstract) -- Mobility Types for Mobile Ambients -- Protein Folding, the Levinthal Paradox and Rapidly Mixing Markov Chains -- Decidable Fragments of Simultaneous Rigid Reachability -- Text Compression Using Antidictionaries -- Non-interactive Zero-Knowledge: A Low-Randomness Characterization of NP (Extended Abstract) -- Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem -- Space-Time Tradeoffs for Graph Properties -- Boundedness of Reset P/T Nets -- Two-way finite state transducers and monadic second-order logic -- Partially Ordered Regular Languages for Graph Queries -- Deciding First-Order Properties of Locally Tree-Decomposable Graphs -- Comparison of Process Algebra Equivalences Using Formats -- Compact Routing Tables for Graphs of Bounded Genus (Extended Abstract) -- Computing LOGCFL Certificates -- Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (Extended Abstract) -- On the Complements of Partial k-Trees -- Approximation Results for Kinetic Variants of TSP -- Distributed Probabilistic Polling and Applications to Proportionate Agreement -- Bisimulation Equivalence Is Decidable for Normed Process Algebra (Extended abstract) -- A Framework for Decidable Metrical Logics -- On the Power of Las Vegas II. Two-Way Finite Automata -- Stable Marriage with Incomplete Lists and Ties -- Average-Case Complexity of Shellsort (Preliminary Version) -- Linear-Time Construction of Two-Dimensional Suffix Trees (Extended Abstract) -- A Connection between the Star Problem and the Finite Power Property in Trace Monoids (Extended Abstract) -- Two Techniques in the Area of the Star Problem -- Approximations by OBDDs and the Variable Ordering Problem -- Simulation Preorder on Simple Process Algebras -- Solos in Concert -- Shortest Anisotropic Paths on Terrains -- Relations between Local and Global Periodicity of Words (Extended Abstract) -- Efficient Merging, Construction, and Maintenance of Evolutionary Trees -- Formalizing a Lazy Substitution Proof System for ?-Calculus in the Calculus of Inductive Constructions -- Leader Election by d Dimensional Cellular Automata -- New Upper Bounds for MaxSat -- Polynomial and Rational Evaluation and Interpolation (with Structured Matrices) ? -- Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time -- Finite Automata with Generalized Acceptance Criteria -- A Variant of the Arrow Distributed Directory with Low Average Complexity (Extended Abstract) -- Closed Freyd- and ?-categories -- Typed Exceptions and Continuations Cannot Macro-Express Each Other -- Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously (Extended Abstract) -- Accessing Multiple Sequences Through Set Associative Caches -- T(A) = T(B)? -- Many-Valued Logics and Holographic Proofs -- On the Complexity and Inapproximability of Shortest Implicant Problems -- The Wave Propagator Is Turing Computable -- An FPTAS for Agreeably Weighted Variance on a Single Machine (Extended Abstract) -- Erratum: Bulk-Synchronous Parallel Multiplication of Boolean Matrices. |
| Record Nr. | UNISA-996465735103316 |
| Berlin : , : Springer, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Soggetto topico
-
Formal languages
(70)
- Machine theory (36)
- Semigroups (9)
- Computational linguistics (8)
- Computer programming (7)