Filters








14,426 Hits in 5.0 sec

Implementation and Application of Automata in String Processing [chapter]

Gonzalo Navarro
2009 Lecture Notes in Computer Science  
Automata have been enormously successful in matching different types of complex patterns on sequences, with applications in many areas, from text retrieval to bioinformatics, from multimedia databases  ...  We then show applications of these ideas to natural language processing, where the text is seen as a sequence of words, and bit-parallelism allows flexibility in the matching at the word level, for example  ...  Automata have been enormously successful in matching different types of complex patterns on sequences, with applications in many areas, from text retrieval to bioinformatics, from multimedia databases  ... 
doi:10.1007/978-3-642-02979-0_1 fatcat:wq4kdu76sncw3oktj3u72igwo4

Mobile Learning Application for Language and Automata Theory using Android-based

Maulana Muhamad Sulaiman, Romi Andrianto, Muhamad Arief Yulianto
2020 JOIN: Jurnal Online Informatika  
And the development of this learning media use the ADDIE development model (analysis, design, development, implementation, evaluation) to design language and automata theory applications learning so can  ...  The language and automata theory are which required course must implemented by college student in informatic engineering study program.  ...  And to Pamulang University which has provided good shelter, facilities and infrastructure and also to LPPM UNPAM which assist the author to implementation this research and to UIN Sunan Gunung Djati Bandung  ... 
doi:10.15575/join.v5i2.630 fatcat:tu2tyq6djba7fmtg4gxgw4kily

Stranger: An Automata-Based String Analysis Tool for PHP [chapter]

Fang Yu, Muath Alkhalaf, Tevfik Bultan
2010 Lecture Notes in Computer Science  
STRANGER is an automata-based string analysis tool for finding and eliminating string-related security vulnerabilities in PHP applications.  ...  STRANGER uses symbolic forward and backward reachability analyses to compute the possible values that the string expressions can take during program execution.  ...  STRANGER implements an automata-based approach [8, 9] for automatic verification of string manipulating programs based on symbolic string analysis.  ... 
doi:10.1007/978-3-642-12002-2_13 fatcat:y2xmnvd5brf5vitk34wwsgc7ou

ANMLzoo: a benchmark suite for exploring bottlenecks in automata processing engines and architectures

Jack Wadden, Vinh Dang, Nathan Brunelle, Tommy Tracy II, Deyuan Guo, Elaheh Sadredini, Ke Wang, Chunkun Bo, Gabriel Robins, Mircea Stan, Kevin Skadron
2016 2016 IEEE International Symposium on Workload Characterization (IISWC)  
With the recent availability of architectures and software frameworks for automata processing, many new applications have been found to benefit from automata processing.  ...  We then present insights from five experiments showing how ANMLZoo can be used to expose bottlenecks in both automata-processing software engines and hardware architectures.  ...  We would also like to thank contributors of ANMLZoo benchmarks including public sources, Michela Becchi, and Micron Technologies.  ... 
doi:10.1109/iiswc.2016.7581271 dblp:conf/iiswc/WaddenDBTGSWBRS16 fatcat:v7lw5u7e55dfzkukkgjbeflznq

Algorithm Design for Deterministic Finite Automata for a Given Regular Language with Prefix Strings

Rashandeep Singh, Dr. Gulshan Goyal
2022 Journal of scientific research  
Other applications of finite automata include pattern matching, speech and text processing, CPU machine operations, etc.  ...  The construction of finite automata is a complicated and challenging process as there is no fixed mathematical approach that exists for designing Deterministic Finite Automata (DFA) and handling the validations  ...  DFA has extreme importance in many applications such as it is used in token recognition in compiler design [5] . It is also used in text processing [20] and speech processing [5] .  ... 
doi:10.37398/jsr.2022.660203 fatcat:lkokfoxdn5ampku7rkmicot4ei

Efficient String Matching Using Deterministic Finite Automation Hardware: Speed vs Area Tradeoff

Aakanksha Pandey, Nilay Khare
2012 International Journal of Computer Applications  
Pattern matching is a crucial task in several critical network services such as intrusion detection and matching of the IP address during packet forwarding by the router.  ...  In this paper we present an speed vs area tradeoff of the the original DFA and the DFA called delayed input DFA(D 2 FA) with optimized area by eliminating the redundant transition edges.In delayed input  ...  Finite automata provide the easiest way of pattern matching but Depending on the application being considered, it can be the case that the size of the input string tothe DFA is large (e.g. the text T in  ... 
doi:10.5120/6366-8750 fatcat:7p3dj6rusjbatmsoewwksetw5m

Page 6372 of Mathematical Reviews Vol. , Issue 97J [page]

1997 Mathematical Reviews  
Stochastic learning automata (SLA); 3. Artificial neural networks (ANN); 4. Genetic and evo- lutionary optimisation; 5. Applications in signal processing; 6. Applications in systems control; 7.  ...  In ad- dition to the academic community, the book is of direct interest to individuals concerned with the application of learning techniques in adaptive signal processing, control and communications.”  ... 

An autonomous DNA model for finite state automata

Israel M. Martinez Perez, Karl Heinz Zimmermann, Zoya Ignatova
2009 International Journal of Bioinformatics Research and Applications  
The sticker automata model will allow (theoretically) to implement all kind of applications for finite automata at the molecular level.  ...  These models differ by the degree of implementability, autonomy, programmability, and energy saving.  ...  If we suceed, the generality of the model would allow to implement all kinds of applications for finite automata at the molecular level (at least in theory).  ... 
doi:10.1504/ijbra.2009.022465 pmid:19136366 fatcat:udohgrjbqvcpdjrlc46l3mn7um

A FRAMEWORK FOR THE DYNAMIC IMPLEMENTATION OF FINITE AUTOMATA FOR PERFORMANCE ENHANCEMENT

ERNEST KETCHA NGASSAM, BRUCE W. WATSON, DERRICK G. KOURIE
2005 International Journal of Foundations of Computer Science  
Moreover, the kind of string being recognized plays a major role in the overall processing speed of the string recognizer.  ...  The aim of this work is to provide a model for the dynamic implementation of finite automata for enhanced performance.  ...  Its update is something that can happen at a post-processing stage, and does not appear to be time-critical. Applications of DIFAP Finite automata are used to model several computational problems.  ... 
doi:10.1142/s0129054105003753 fatcat:rix27jnriba6zgcaa7hhrrpeje

Editorial

2000 Theoretical Computer Science  
The workshops not only address issues of theory and practice within the framework of automata, grammar, and language theory, but also provide a clarion call to both practitioners and theoreticians in computer  ...  We anticipate that experimental computer science will continue and develop, and that, through experimentalism, we will enjoy a renaissance in the interaction of theory and practice.  ...  Implementation and application have also provided new interest and new research directions in automata and formal-language theory.  ... 
doi:10.1016/s0304-3975(99)00012-2 fatcat:s2smvxwuv5fzdjaqucd67j5kda

Treating Insomnia, Amnesia, and Acalculia in Regular Expression Matching [article]

Luis Quesada and Fernando Berzal and Francisco J. Cortijo
2011 arXiv   pre-print
Regular expressions provide a flexible means for matching strings and they are often used in data-intensive applications.  ...  Existing techniques require an automata conversion and compaction step that prevents the use of existing automaton databases and hinders the maintenance of the resulting compact automata.  ...  implementation would yield no reduction on the number of states and would decrease the efficiency of the PFSM implementation both in terms of time and space. D.  ... 
arXiv:1110.1716v2 fatcat:r3hmcnnflzfplk56nxxduq5mlq

A Proposed Simulation Model of Automatic Machine For House Paint Selection Using Finite State Automata

2015 International Journal of Computer Applications Technology and Research  
In the mean while, the approach automata models used are Finite State Automata (FSA) has the characteristics due to work by identifying and capturing the pattern in the compilation process of determining  ...  At the same time, in the design of a prototype, also produced mockup simulation applications in order to generate automatic machine house paint selection.  ...  and can be implemented in practice.  ... 
doi:10.7753/ijcatr0412.1007 fatcat:xx2w5al6dvbndfaenjiccrwp7i

The design principles of a weighted finite-state transducer library

Mehryar Mohri, Fernando Pereira, Michael Riley
2000 Theoretical Computer Science  
applications involving weighted automata of more than 10 7 states and transitions.  ...  By taking advantage of the theory of rational power series, we were able to achieve high degrees of generality, modularity and irredundancy, while attaining competitive e ciency in demanding speech processing  ...  cases, and with the cross product of the string semiring and one of these semirings in the case of weighted transducers.  ... 
doi:10.1016/s0304-3975(99)00014-6 fatcat:fguty4gp5rca3esuvvm3ovntmm

Implementation of Finite State Automata in an Amusement Park Automatic Ticket Selling Machine

Fergie Joanda Kaunang, Jacquline Waworundeng
2019 Abstract proceedings international scholars conference  
In this application, the concept of Finite State Automata was applied to recognize and then capture the pattern on the process of ticket selling machine.  ...  Discussion: In this application, the payment method is by inserting a certain amount of cash into the machine and the machine will proceed to the next process.  ...  In this application, the payment method is by inserting a certain amount of cash into the machine and the machine will proceed to the next process.  ... 
doi:10.35974/isc.v7i1.1979 fatcat:7awpnfigijdk7a7sbhp3w7ss5i

Generating Functional Implementations of Finite State Automata in C# 3.0

Mihály Biczó, Krisztián Pócza
2009 Electronical Notes in Theoretical Computer Science  
Finite state automata (FSA) implementations are widely used in IT due to their rich application possibilities, flexibility, and their direct relationship with common goals set by regular business applications  ...  However, due to the advantageous properties of FSA, it is often desirable to build applications around FSA implementations in simpler cases as well.  ...  (In the current implementation, the input of the automaton is always of type string. This can also be extended in future versions.)  ... 
doi:10.1016/j.entcs.2009.05.002 fatcat:rfv5wrmaizedplslwlbqice4uy
« Previous Showing results 1 — 15 out of 14,426 results