Filters








2,727 Hits in 7.4 sec

Page 3194 of Mathematical Reviews Vol. , Issue 88f [page]

1988 Mathematical Reviews  
In the same paper, they raised the question whether string- matching can be done by a k-head one-way deterministic finite automation (ldfa(k), for short), for any k.  ...  Seiferas [Proceedings of the thirteenth annual ACM sympo- sium on theory of computing, 106-113, ACM, New York, 1981; per bibl.] proved that string-matching can be done by a 6-head deter- ministic two-way  ... 

Two-way Nanoscale automata [article]

Debayan Ganguly, Kingshuk Chatterjee, Kumar Sankar Ray
2020 arXiv   pre-print
finite automata cannot accept.  ...  Here we compare the computational power of two-way Watson-Crick automata and two-way Quantum finite automata and we observe that two-way Watson-Crick automata can accept a language which two-way quantum  ...  So only rules having λ on the upper head can be applied to the original machine M at this stage. As M' replicates M similar thing is done in M' too.  ... 
arXiv:2005.07569v1 fatcat:mlfagal35zezlk6lppg4cnu5kq

Fooling a two way automation or one pushdown store is better than one counter for two way machines

Pavol Duris, Zvi Galil
1982 Theoretical Computer Science  
Since L is acceptecl by a two-way deterministic pushdown automaton, we consequently show that one puskdown stack: is more powerful than one counter for deterministic two way machines. P. L3riri.i Z.  ...  We define a language L and show that it cannot be recognized by any twc: zay deterministic counter machine.  ...  One-wa3 multihead finite automata versus reaMime two-way two-head deterministic finite automata Consider the following t\YcA classes of languages: The class of languages accepted1 by one-way multihead  ... 
doi:10.1016/0304-3975(82)90087-1 fatcat:qohaqalonbh7fgb2x4pxmda6zq

Protomatching network traffic for high throughputnetwork intrusion detection

Shai Rubin, Somesh Jha, Barton P. Miller
2006 Proceedings of the 13th ACM conference on Computer and communications security - CCS '06  
Protomatching is based on a novel signature with two properties. First, the signature ensures that the attack pattern appears in the context that enables successful attack.  ...  Before performing pattern matching, a typical misuse-NIDS performs protocol analysis: it parses network traffic according to the attack protocol and normalizes the traffic into the form used by its signatures  ...  a protomatcher that can be used in practice to match our protomatching signatures, based on a deterministic finite state machine and based on an hierarchical state machine.  ... 
doi:10.1145/1180405.1180413 dblp:conf/ccs/RubinJM06 fatcat:njukrv6eu5bkfgdiupobotzssa

Efficient parametric runtime verification with deterministic string rewriting

Patrick Meredith, Grigore Rosu
2013 2013 28th IEEE/ACM International Conference on Automated Software Engineering (ASE)  
The presented monitoring algorithm uses a modified version of the Aho-Corasick string searching algorithm for quick pattern matching with an incremental rewriting approach that avoids reexamining parts  ...  This paper presents a monitor synthesis algorithm for string rewriting systems (SRS).  ...  Aside from specifying properties which cannot be expressed by context-free grammars, string rewriting systems can be useful for expressing context-free and finite properties in a natural, and often times  ... 
doi:10.1109/ase.2013.6693067 dblp:conf/kbse/MeredithR13 fatcat:ri7htctk7zfwfkoh6g2zkfqgpi

Enhancement of Turing Machine to Universal Turing Machine to Halt for Recursive Enumerable Language and its JFLAP Simulation

Tribikram Pradhan
2015 International Journal of Hybrid Information Technology  
A Directed graph is be used to represent a Turing Machine, uses by JFLAP. It is widely used to simulate UTM as transducer of the Turing machine and it consists of multiple inputs.  ...  As well as testing and making another example for these, JFLAP provide one to research with construction proofs from one form to another, such as converting an NFA to a DFA to a minimal state DFA to a  ...  The Part of memory which is hold two lists i.e. of final-states and list-of-transitions, is cannot be changed by TU.  ... 
doi:10.14257/ijhit.2015.8.1.17 fatcat:hstolwq7ujaudll3hvrki43tum

Reachability Analysis for Some Models of Infinite-State Transition Systems [chapter]

Oscar H. Ibarra, Tevfik Bultan, Jianwen Su
2000 Lecture Notes in Computer Science  
There is no bound on how long the head can remain on a cell.  ...  (ii) A tape counter machine (TCM) is a CM augmented with a two-way read/write worktape that is restricted in that the number of times the head crosses the boundary between any two adjacent cells of the  ...  by deterministic CM acceptors.  ... 
doi:10.1007/3-540-44618-4_15 fatcat:fyws5qzlkrbqreoekyxxjj3qxu

Using Grammatical Inference to Automate Information Extraction from the Web [chapter]

Theodore W. Hong, Keith L. Clark
2001 Lecture Notes in Computer Science  
These partial sources could be used more effectively if integrated into a single view; however, since they are typically formatted in diverse ways for human viewing, extracting their data for integration  ...  The method is demonstrated in a test setting by extracting real estate listings from web pages and integrating them into an interactive data visualization tool based on dynamic queries.  ...  This material is based upon work supported under a National Science Foundation Graduate Fellowship.  ... 
doi:10.1007/3-540-44794-6_18 fatcat:knpuifcefvbkvkidmpl3fzna3e

Parallel parsing made practical

Alessandro Barenghi, Stefano Crespi Reghizzi, Dino Mandrioli, Federica Panella, Matteo Pradella
2015 Science of Computer Programming  
The work is concluded by a broad and critical survey of the past work on parallel parsing and future directions on the integration with semantic analysis and incremental parsing.  ...  The property of local parsability allows to parse inputs through inspecting only a bounded-length string around the current token.  ...  Any disambiguation that cannot be performed during the single worker analysis is done when the partial token lists are joined into a single one.  ... 
doi:10.1016/j.scico.2015.09.002 fatcat:h5xzooyiizh3vkmc6pwvnl63u4

Comparing two grammar-based generation algorithms

Miroslav Martinovic, Tomek Strzalkowski
1992 Proceedings of the 30th annual meeting on Association for Computational Linguistics -  
We show that EAA's traversals of the analysis tree for a given language construct, include also the one taken on by SHDGA.  ...  In this paper we compare two grammar-based generation algorithms: the Semantic-Head-Driven Generation Algorithm (SHDGA), and the Essential Arguments Algorithm (EAA).  ...  ACKNOWLEDGEMENTS This paper is based upon work supported by the Defense Advanced Research Project Agency under Contract N00014-90-J-1851 from the Office of Naval Research, the National Science Foundation  ... 
doi:10.3115/981967.981978 dblp:conf/acl/MartinovicS92 fatcat:gf4c3yxmejhvhluighjqeq3zni

Parallel String Matching Problems with Computing Models An Analysis of the Most Recent Studies

K ButchiRaju, Chinta Someswara Rao, S. Viswanadha Raju
2013 International Journal of Computer Applications  
We focus on current developments of parallel string matching, computing models, and the central ideas of the algorithms and their complexities.  ...  We survey the current techniques to handle with the problem of parallel string matching with computing models.  ...  Prasanna [42] proposed a head-body finite automaton (HBFA) which implements SPM in two parts: a head DFA (H-DFA) and a body NFA (B-NFA).  ... 
doi:10.5120/13321-0738 fatcat:ca3hjbzpxrc2rgjn7tjmhca4ni

Verifying time complexity of Turing machines

David Gajser
2015 Theoretical Computer Science  
This is a tight bound on the order of growth for the function T because we prove that, for T(n)≥(n+1) and T(n)=Ω(n n), there exists no algorithm that would verify whether a given one-tape Turing machine  ...  In particular, we cannot verify whether a Turing machine runs in constant, polynomial or exponential time.  ...  M physically consists of three things: a two-way infinite tape, a head and a state control.  ... 
doi:10.1016/j.tcs.2015.07.028 fatcat:fvnwtvagpjgs7dhb46pqv6vbda

Between order and chaos

James P. Crutchfield
2011 Nature Physics  
Over the past few decades physics' view of nature's lack of structure-its unpredictability-underwent a major renovation with the discovery of deterministic chaos, overthrowing two centuries of Laplace's  ...  What is a pattern? How do we come to recognize patterns never seen before?  ...  Acknowledgements I thank the Santa Fe Institute and the Redwood Center for Theoretical Neuroscience, University of California Berkeley, for their hospitality during a sabbatical visit.  ... 
doi:10.1038/nphys2190 fatcat:gd2kigj5praorgxzzhngr35czu

Narrowing Down XML Template Expansion and Schema Validation [article]

René Haberland
2021 arXiv   pre-print
Implementation allows unification of both processes on document-level. The validity of all implementations is guaranteed by a comprehensive test suite.  ...  Instantiation shows a universal gap in applications, for instance, as seen by XSLT.  ...  At lines 16-27, there is a non-deterministic decision to be made on whether child nodes match for a cycle.  ... 
arXiv:1912.10816v2 fatcat:mbz4sp4egbar7ceysa7qu4vkru

Lightweight string reasoning in model finding

Fabian Büttner, Jordi Cabot
2013 Journal of Software and Systems Modeling  
Precise models usually require the definition of well-formedness rules to specify constraints that cannot be expressed graphically.  ...  We have integrated our solver into the EMFtoCSP model finder, and we show that our implementation efficiently solves several common string constraints on a large instances.  ...  It provide a way to automatically instantiate such models (e.g., as test cases) on a scale that cannot be handled by a simple relational/SAT encoding. On intractable constraints, it performs worse.  ... 
doi:10.1007/s10270-013-0332-x fatcat:mowobp2ceze2tpdmwgfxkmnl6y
« Previous Showing results 1 — 15 out of 2,727 results