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.
Implementation and application of automata : 11th international conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006 : proceedings / / Oscar H. Ibarra, Hsu-Chun Yen (eds.)
| Implementation and application of automata : 11th international conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006 : proceedings / / Oscar H. Ibarra, Hsu-Chun Yen (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, : Springer, c2006 |
| Descrizione fisica | 1 online resource (XIII, 291 p.) |
| Disciplina | 004 |
| Altri autori (Persone) |
IbarraOscar H
YenHsu-Chun <1958-> |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico | Machine theory |
| ISBN | 3-540-37214-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Information Distance and Its Applications -- Theory Inspired by Gene Assembly in Ciliates -- On the State Complexity of Combined Operations -- Technical Contributions -- Path-Equivalent Removals of ?-transitions in a Genomic Weighted Finite Automaton -- Hybrid Extended Finite Automata -- Refinement of Near Random Access Video Coding with Weighted Finite Automata -- Borders and Finite Automata -- Finding Common Motifs with Gaps Using Finite Automata -- Factor Oracles -- Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice -- Tiburon: A Weighted Tree Automata Toolkit -- Around Hopcroft’s Algorithm -- Multi-tape Automata with Symbol Classes -- On the Computation of Some Standard Distances Between Probabilistic Automata -- Does o-Substitution Preserve Recognizability? -- Correctness Preservation and Complexity of Simple RL-Automata -- Bisimulation Minimization of Tree Automata -- Forgetting Automata and Unary Languages -- Structurally Unambiguous Finite Automata -- Symbolic Implementation of Alternating Automata -- On-the-Fly Branching Bisimulation Minimization for Compositional Analysis -- Finite-State Temporal Projection -- Compiling Linguistic Constraints into Finite State Automata -- Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time -- A Family of Algorithms for Non Deterministic Regular Languages Inference -- Poster Abstracts -- XSLT Version 2.0 Is Turing-Complete: A Purely Transformation Based Proof -- A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems -- Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits -- Reachability Analysis of Procedural Programs with Affine Integer Arithmetic -- Lexical Disambiguation with Polarities and Automata -- Parsing Computer Languages with an Automaton Compiled from a Single Regular Expression -- Tighter Packed Bit-Parallel NFA for Approximate String Matching. |
| Altri titoli varianti | CIAA 2006 |
| Record Nr. | UNINA-9910484505103321 |
| Berlin, : Springer, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
WALCOM: Algorithms and Computation : 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, Proceedings / / edited by Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen
| WALCOM: Algorithms and Computation : 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, Proceedings / / edited by Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (449 pages) |
| Disciplina | 511.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Computer science - Mathematics Discrete mathematics Numerical analysis Algorithms Computer graphics Information technology - Management Theory of Computation Discrete Mathematics in Computer Science Numerical Analysis Design and Analysis of Algorithms Computer Graphics Computer Application in Administrative Data Processing |
| ISBN | 9789819705665 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Recent Research Activities on Algorithmic Foundations for Social Advancement -- Reasons to Fall (More) in Love with Combinatorial Reconfiguration -- Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle -- Quantum Graph Drawing -- Simultaneous Drawing of Layered Trees -- Fully Dynamic Algorithms for Euclidean Steiner Tree -- The Parameterized Complexity of Terminal Monitoring Set -- Generating cyclic 2-Gray codes for Fibonacci q-decreasing words -- On the Hardness of Gray Code Problems for Combinatorial Objects -- On MAX‒SAT with Cardinality Constraint -- Minimizing Corners in Colored Rectilinear Grids -- On Layered Area-Proportional Rectangle Contact Representations -- Short Flip Sequences to Untangle Segments in the Plane -- Improved Approximation Algorithms for Cycle and Path Packings -- Exact and Approximate Hierarchical Hub Labeling -- Reconfiguration of Multisets with Applications to Bin Packing -- The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules -- Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis -- A bisection approach to subcubic maximum induced matching -- Stable and Dynamic Minimum Cuts -- Black Hole Search in Dynamic Cactus Graph -- Recognition and Isomorphism of Proper H-graphs for unicyclic H in FPT-time -- Canonization of a random circulant graph by counting walks -- Counting Vanishing Matrix-Vector Products -- Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs -- (t,s)-completely Independent Spanning Trees -- Orientable Burning Number of Graphs -- Dichotomies for Tree Minor Containment with Structural Parameters -- Structural Parameterizations of Vertex Integrity -- On the Complexity of List H-Packing for Sparse Graph Classes. |
| Record Nr. | UNINA-9910842290403321 |
| Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||