RIGHT-LINEAR FINITE PATH OVERLAPPING REWRITE SYSTEMS EFFECTIVELY PRESERVE RECOGNIZABILITY

スポンサーリンク

概要

• 論文の詳細を見る
• 2010-03-01

著者

• Kaji Y

  Nara Inst. Of Sci. And Technol. Ikoma‐shi Jpn

• Kaji Yuichi

  Graduate School Of Information Science Nara Institute Of Science And Technology

• Seki H

  Graduate School Of Information Science Nara Institute Of Science And Technology

• SEKI Hiroyuki

  Graduate School of Information Science, Nara Institute of Science and Technology

• TAKAI TOSHINORI

  Research Center for Verification and Semantics National Institute of Advanced Industrial Science and

• Seki Hiroyuki

  Graduate School Of Information Science Nara Institute Of Science And Technology

• Takai Toshinori

  Research Center For Verification And Semantics National Institute Of Advanced Industrial Science And

関連論文

• MAP and LogMAP Decoding Algorithms for Linear Block Codes Using a Code Structure(Special Section on Information Theory and Its Applications)
• On the Minimum Weight of Simple Full-Length Array LDPC Codes
• Adaptive Recursive Maximum Likelihood Decoding Based on the Coarsest Parallel Concatenation Decomposition : Evaluation of the Decoding Complexity by Simulation
• A Formal Approach to Detecting Security Flaws in Object-Oriented Databases (Special Issue on New Generation Database Technologies)
• An Authorization Model for Object-Oriented Databases and Its Efficient Access Control
• Assignment of Data Types to Words in a Natural Language Specification
• Implementation of Natural Language Specifications of Communication Protocols by Executable Specifications
• A Translation Method from Natural Language Specifications of Communication Protocols into Algebraic Specifications Using Contextual Dependencies
• RNA Pseudoknotted Structure Prediction Using Stochastic Multiple Context-Free Grammar
• On the Generative Power of Grammars for RNA Secondary Structure(Foundations of Computer Science)
• RIGHT-LINEAR FINITE PATH OVERLAPPING REWRITE SYSTEMS EFFECTIVELY PRESERVE RECOGNIZABILITY
• Syntactic Unification Problems under Constrained Substitutions
• A Polynomial Time Learning Algorithm for Recognizable Series
• Layered Transducing Term Rewriting System and Its Recognizability Preserving Property (Special Issue on Selected Papers from LA Symposium)
• Termination Property of Inverse Finite Path Overlapping Term Rewriting System is Decidable
• A Polynomial-Time Recognizable Subclass of Lexical-Functional Grammars
• A Note on Inadequacy of the Model for Learning from Queries
• Finite State Translation Systems and Parallel Multiple Context-Free Grammars
• The Universal Recognition Problems for Multiple Context-Free Grammars and for Linear Context-Free Rewriting Systems
• Two-dimensional barcode system with extreme density : some investigation on the error correcting mechanism
• Secure, Efficient and Practical Key Management Scheme in the Complete-Subtree Method(Application)(Cryptography and Information Security)
• Key Predistribution Schemes for Sensor Networks Using Finite Plane Geometry
• Using Trapdoor Permutations in a Complete Subtree Method for Broadcast Encryption(Information Security)
• Maximum Likelihood Decoding for Linear Block Codes Using Grobner Bases
• A Labeled Transition Model A-LTS for History-Based Aspect Weaving and Its Expressive Power
• A Soft-Decision MLD Algorithm for Linear Block Codes Using Grobner Bases
• Decoding Linear Block Codes Using the Ordered Statistics and MLD Techniques
• New certificate chain discovery methods for trust establishment in ad hoc networks and their evaluation (特集:次世代社会基盤をもたらす高度交通システムとモバイル通信システム)
• Policy Controlled System and Its Model Checking
• Decidability of the Security Verification Problem for Programs with Stack Inspection
• A Call-by-Need Recursive Algorithm for the LogMAP Decoding of a Binary Linear Block Code(Information Theory)
• A Call-by-Need Recursive Algorithm for the LogMAP Decoding of a Linear Block Code
• A Call-by-Need Recursive Algorithm for the LogMAP Decoding of a Binary Linear Block Code
• Tree Automaton with Tree Memory
• Static Analysis for k-secrecy against Inference Attacks
• An Efficient Method for Optimal Probe Deployment of Distributed IDS(Dependable Computing)
• Encoding LDPC Codes Using the Triangular Factorization(Coding Theory,Information Theory and Its Applications)
• The Expected Write Deficiency of Index-Less Indexed Flash Codes
• RNA Pseudoknotted Structure Prediction Using Stochastic Multiple Context-Free Grammar
• Deciding Schema k-Secrecy for XML Databases
• Uniform-Compartment Flash Code and Binary-Indexed Flash Code
• Flash Code Utilizing Binary-Indexed Slice Encoding and Resizable-Clusters
• A Static Analysis using Tree Automata for XML Access Control
• New Certificate Chain Discovery Methods for Trust Establishment in Ad Hoc Networks and Their Evaluation
• Multi-Mode Encoding with Binary-Indexed Flash Code
• New Certificate Chain Discovery Methods for Trust Establishment in Ad Hoc Networks and Their Evaluation
• Runtime Control of a Program based on Quantitative Information Flow

もっと見る 閉じる

スポンサーリンク