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 | ||
| ||
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 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. | UNINA-9910586636603321 |
|
Pettorossi Alberto
|
||
| Cham, Switzerland : , : Springer International Publishing, , [2022] | ||
| 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 |
| 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 : 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010 : proceedings. Part I / / Samson Abramsky ... [et al.], (eds.)
| Automata, languages and programming : 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010 : proceedings. Part I / / Samson Abramsky ... [et al.], (eds.) |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2010 |
| Descrizione fisica | 1 online resource (XXIII, 754 p. 42 illus.) |
| Disciplina | 005.1 |
| Altri autori (Persone) | AbramskySamson |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues Advanced research in computing and software science |
| Soggetto topico |
Machine theory
Computer programming Robots - Programming Formal languages |
| ISBN |
1-280-38772-6
9786613565648 3-642-14165-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Local Search: Simple, Successful, But Sometimes Sluggish -- When Conflicting Constraints Can Be Resolved – The Lovász Local Lemma and Satisfiability -- Session 1-Track A. Combinatorial Optimization -- Plane Spanners of Maximum Degree Six -- The Positive Semidefinite Grothendieck Problem with Rank Constraint -- Cycle Detection and Correction -- Decomposition Width of Matroids -- Session 2-Track A1. Game Theory -- The Cooperative Game Theory Foundations of Network Bargaining Games -- On the Existence of Pure Nash Equilibria in Weighted Congestion Games -- On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions -- Mean-Payoff Games and Propositional Proofs -- Session 2-Track A2. Security -- Online Network Design with Outliers -- Efficient Completely Non-malleable Public Key Encryption -- Polynomial-Space Approximation of No-Signaling Provers -- From Secrecy to Soundness: Efficient Verification via Secure Computation -- Session 3-Track A1. Data Structures -- Mergeable Dictionaries -- Faster Algorithms for Semi-matching Problems (Extended Abstract) -- Clustering with Diversity -- New Data Structures for Subgraph Connectivity -- Session 3-Track A2. Sorting & Hashing -- Tight Thresholds for Cuckoo Hashing via XORSAT -- Resource Oblivious Sorting on Multicores -- Interval Sorting -- Session 4-Track A. Graphs, Nets and Optimization -- Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems -- Thresholded Covering Algorithms for Robust and Max-min Optimization -- Graph Homomorphisms with Complex Values: A Dichotomy Theorem -- Metrical Task Systems and the k-Server Problem on HSTs -- Session 5-Track A1. Scheduling -- Scheduling Periodic Tasks in a Hard Real-Time Environment -- Scalably Scheduling Power-Heterogeneous Processors -- Better Scalable Algorithms for Broadcast Scheduling -- Max-min Online Allocations with a Reordering Buffer -- Session 5-Track A2. Graphs & Hypergraphs -- Orientability of Random Hypergraphs and the Power of Multiple Choices -- On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs -- Dynamic Programming for Graphs on Surfaces -- Interval Graphs: Canonical Representation in Logspace -- Session 6-Track A. Best Paper Award -- Approximating the Partition Function of the Ferromagnetic Potts Model -- Session 7-Track A. Algebraic Problems -- On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors -- On Sums of Roots of Unity -- Exponential Time Complexity of the Permanent and the Tutte Polynomial -- On Approximate Horn Formula Minimization -- Session 8-Track A. Networks & Communication Complexity -- Choosing, Agreeing, and Eliminating in Communication Complexity -- Additive Spanners in Nearly Quadratic Time -- Composition Theorems in Communication Complexity -- Network Design via Core Detouring for Problems without a Core -- Session 9-Track A1. Complexity & Automata -- Weak Completeness Notions for Exponential Time -- Efficient Evaluation of Nondeterministic Automata Using Factorization Forests -- On the Complexity of Searching in Trees: Average-Case Minimization -- Session 9-Track A2. Finding & Testing -- Finding Is as Easy as Detecting for Quantum Walks -- Improved Constructions for Non-adaptive Threshold Group Testing -- Testing Non-uniform k-Wise Independent Distributions over Product Spaces -- Session 10-Track A1. Approximations -- A Sublogarithmic Approximation for Highway and Tollbooth Pricing -- Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm -- Cell Probe Lower Bounds and Approximations for Range Mode -- SDP Gaps for 2-to-1 and Other Label-Cover Variants -- Session 10-Track A2. Streaming & Preprocessing -- Data Stream Algorithms for Codeword Testing -- Streaming Algorithms for Independent Sets -- Preprocessing of Min Ones Problems: A Dichotomy -- Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems -- Session 11-Track A1. Adaptive, Knowledge & Optimality -- Optimal Trade-Offs for Succinct String Indexes -- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems -- Concurrent Knowledge Extraction in the Public-Key Model -- Session 11-Track A2. Covering, Graphs & Independence -- On the k-Independence Required by Linear Probing and Minwise Independence -- Covering and Packing in Linear Space -- Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs. |
| Record Nr. | UNINA-9910484310003321 |
| Berlin, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata, languages and programming : 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010 : proceedings. Part II / / Samson Abramsky ... [et al.], (eds.)
| Automata, languages and programming : 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010 : proceedings. Part II / / Samson Abramsky ... [et al.], (eds.) |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2010 |
| Descrizione fisica | 1 online resource (XXIV, 614 p. 78 illus.) |
| Disciplina | 005.11 |
| Altri autori (Persone) | AbramskySamson |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Machine theory
Formal languages Computer programming |
| ISBN |
1-280-38771-8
9786613565631 3-642-14162-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Informative Labeling Schemes -- Noetherian Spaces in Verification -- Towards a Theory of Time-Bounded Verification -- Physical Algorithms -- Session 1-Track B. Automata -- Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata -- Pumping and Counting on the Regular Post Embedding Problem -- Alternation Removal in Büchi Automata -- Linear Orders in the Pushdown Hierarchy -- Session 1-Track C. Communication in Networks -- The Serializability of Network Codes -- How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange) -- Efficient Information Exchange in the Random Phone-Call Model -- An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines -- Session 2-Track B. Formal Languages -- A Topological Approach to Recognition -- On LR(k)-Parsers of Polynomial Size -- On Erasing Productions in Random Context Grammars -- Session 4-Track B. Semantics -- Game Semantics for Call-by-Value Polymorphism -- What Is a Pure Functional? -- Example-Guided Abstraction Simplification -- Compositional Closure for Bayes Risk in Probabilistic Noninterference -- Session 4-Track C. Fault Tolerance, Ranking -- Asynchronous Throughput-Optimal Routing in Malicious Networks -- Improved Fault Tolerance and Secure Computation on Sparse Networks -- Sparse Reliable Graph Backbones -- Approximation Algorithms for Diversified Search Ranking -- Session 5-Track B. Graphs, Categories and Quantum Information -- Rewriting Measurement-Based Quantum Computations with Generalised Flow -- The Compositional Structure of Multipartite Quantum Entanglement -- Compositionality in Graph Transformation -- Session 6-Track B. Best Paper Award -- On p-Optimal Proof Systems and Logics for PTIME -- Session 6-Track C. Best Paper Award -- Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests -- Session 7-Track B. Logic -- Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals -- B and D Are Enough to Make the Halpern–Shoham Logic Undecidable -- Parameterized Modal Satisfiability -- Automata for Coalgebras: An Approach Using Predicate Liftings -- Session 7-Track C. Privacy, Selfishness -- Resolving the Complexity of Some Data Privacy Problems -- Private and Continual Release of Statistics -- Envy-Free Pricing in Multi-item Markets -- Contention Resolution under Selfishness -- Session 8-Track B. Concurrency -- On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi -- On Bisimilarity and Substitution in Presence of Replication -- The Downward-Closure of Petri Net Languages -- Reachability Games on Extended Vector Addition Systems with States -- Session 8-Track C. Mobile Agents -- Modelling Mobility: A Discrete Revolution -- Tell Me Where I Am So I Can Meet You Sooner -- Rendezvous of Mobile Agents without Agreement on Local Orientation -- Session 9-Track B. Probabilistic Computation -- Probabilistic Automata on Finite Words: Decidable and Undecidable Problems -- Space-Efficient Scheduling of Stochastically Generated Tasks -- Exponential Lower Bounds for Policy Iteration -- Session 10-Track B. Automata -- Regular Temporal Cost Functions -- Model Checking Succinct and Parametric One-Counter Automata -- Pebble Weighted Automata and Transitive Closure Logics -- Energy Parity Games. |
| Record Nr. | UNINA-9910484309903321 |
| Berlin, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
