Filters








3,486 Hits in 3.3 sec

Forward Bisimulations for Nondeterministic Symbolic Finite Automata [chapter]

Loris D'Antoni, Margus Veanes
2017 Lecture Notes in Computer Science  
Our second algorithm generalizes Hopcroft's algorithm for minimizing deterministic automata.  ...  We propose three algorithms. Our first algorithm generalizes Moore's algorithm for minimizing deterministic automata.  ...  We thank Zachary Kincaid for his feedback.  ... 
doi:10.1007/978-3-662-54577-5_30 fatcat:3xfyz4s4czedflir7mz5etppuu

Small NFAs from Regular Expressions: Some Experimental Results [article]

Hugo Gouveia, Nelma Moreira, Rogério Reis
2010 arXiv   pre-print
We present the implementation of several algorithms for constructing small epsilon-free NFAss from res within the FAdo system, and a comparison of regular expression measures and NFA sizes based on experimental  ...  For this analysis, nonredundant res and reduced res in star normal form were considered.  ...  We would like to thank the anonymous referees for their comments that helped to improve this paper.  ... 
arXiv:1009.3599v1 fatcat:al7okyao5fdojfx5q5zohbax6y

Efficient multistriding of large non-deterministic finite state automata for deep packet inspection

Matteo Avalle, Fulvio Risso, Riccardo Sisto
2012 2012 IEEE International Conference on Communications (ICC)  
In this paper, new algorithms for efficient building of multistride NFAs for packet inspection are presented, explaining how these new techniques can outperform the previous algorithms in terms of required  ...  However, up to now little effort has been spent in optimizing the building process of multistride automata, with the result that current algorithms cannot be applied to real-life, large automata such as  ...  Using previous algorithms, only the NFAs of very small rulesets could be handled.  ... 
doi:10.1109/icc.2012.6364235 dblp:conf/icc/AvalleRS12 fatcat:g7lfvqvlwjeyzplgn6yny3jyba

On Equivalence Checking of Nondeterministic Finite Automata [chapter]

Chen Fu, Yuxin Deng, David N. Jansen, Lijun Zhang
2017 Lecture Notes in Computer Science  
Based on our experiments, we suggest to use HKC (Hopcroft and Karp's algorithm up to congruence) [4] if the density is large and the alphabet is small; otherwise, we recommend the antichain algorithm (  ...  We provide a comparative study of some typical algorithms for language equivalence in nondeterministic finite automata and various combinations of optimization techniques.  ...  Acknowledgements This work has been supported by the National Natural Science Foundation of China (Grants 61532019, 61472473, 61672229), the CAS/SAFEA International Partnership Program for Creative Research  ... 
doi:10.1007/978-3-319-69483-2_13 fatcat:6jaxlqriuja57jno7ims3viwvu

Reducing NFAs by invariant equivalences

Lucian Ilie, Sheng Yu
2003 Theoretical Computer Science  
We give new general methods for constructing small non-deterministic ÿnite automata (NFA) from arbitrary ones.  ...  Given an NFA, we compute the largest right-invariant equivalence on the set of states and then merge the equivalent states to obtain a smaller automaton.  ...  It is unexpected that this very important problem, of computing small NFAs from regular expressions, did not receive more attention.  ... 
doi:10.1016/s0304-3975(03)00311-6 fatcat:lf5yrhohyzaevkxtwkfk6x47u4

An Unsupervised Algorithm for Detecting Good

José Lezama, Gregory Randall, Jean-Michel Morel, Rafael Grompone von Gioi
2017 Image Processing On Line  
Source Code The MATLAB reviewed source code for this algorithm and a online demo are available from the web page of this article 1 .  ...  In this article we describe an algorithm for the automatic detection of perceptually relevant configurations of 'good continuation' of points in 2D point patterns.  ...  The second stage of the algorithm is to compute the NFA of each path found by the Floyd-Warshall algorithm (Algorithm 1, lines 19 to 21) .  ... 
doi:10.5201/ipol.2017.176 fatcat:v2hmqiyb6vflhf25lctoj4o32y

A unified view to string matching algorithms [chapter]

Ricardo Baeza-Yates
1996 Lecture Notes in Computer Science  
For generalized string matching the time complexity is O(mn= logn) which for small patterns is linear.  ...  This approach gives very fast practical algorithms which have good complexity for small patterns on a RAM machine with word length O(logn), where n is the size of the text.  ...  By computing the dependences between rows, we obtain Wu & Manber's algorithm for approximate string matching WM92].  ... 
doi:10.1007/bfb0037393 fatcat:stehc3qzuvg5rfwurvxlyukmt4

Good continuation in dot patterns: A quantitative approach based on local symmetry and non-accidentalness

José Lezama, Gregory Randall, Jean-Michel Morel, Rafael Grompone von Gioi
2016 Vision Research  
A robust, unsupervised and scaleinvariant algorithm for the detection of good continuation of dots is derived.  ...  An online demonstration of the algorithm allows the reader to directly evaluate the method. Figure 1 : Good Continuation law: human perception tends to group elements on a smooth, continuous order.  ...  When the algorithm detects meaningful curves (NFA < 1), the NFA value is printed for each detection.  ... 
doi:10.1016/j.visres.2015.09.004 pmid:26408332 fatcat:tlcv63voefaxxcr43ll2saiy3q

Neuro-Fuzzy Algorithmic (NFA) Models and Tools for Estimation [article]

Danny Ho, Luiz Fernando Capretz, Xishi Huang, Jing Ren
2015 arXiv   pre-print
We made use of the Constructive Cost Model (COCOMO), Analysis of Variance (ANOVA), and Function Point Analysis as the algorithmic models and validated the accuracy of the Neuro-Fuzzy Algorithmic (NFA)  ...  Our model produces more accurate estimation than using an algorithmic model alone. We also discuss the prototypes of our tools that implement the NFA Model.  ...  We also need to take advantage of the latest development in neural network, fuzzy logic and algorithmic models, and enrich the NFA Model in accurately and consistently providing estimation results.  ... 
arXiv:1508.00037v1 fatcat:w3a5gxkzdvhylc2t32g66dkmwu

Animation of the Generation and Computation of Finite Automata for Learning Software [chapter]

Beatrix Braune, Stephan Diehl, Andreas Kerren, Reinhard Wilhelm
2001 Lecture Notes in Computer Science  
In computer science methods to aid learning are very important, because abstract models are used frequently. For this conventional teaching methods do not suffice.  ...  The software offers on the one hand an interactive introduction to the problems of lexical analysis, in which the most important definitions and algorithms are presented in graphically appealing form.  ...  In the algorithm NFA to DFA, the original NFA and the text of the algorithm are initially shown.  ... 
doi:10.1007/3-540-45526-4_4 fatcat:bk5jy24etbgildjmzawyowzoki

Computing NFA Intersections in Map-Reduce

Gösta Grahne, Shahab Harrafi, Ali Moallemi, Adrian Onet
2015 International Conference on Extending Database Technology  
The most commonly used algorithm for computing the intersection NFA is to use the Cartesian construct for product automata.  ...  ALGORITHMS FOR THE CARTESIAN CONSTRUCT In this section we propose and analyze three different algorithms for computing A = A 1 ⊗ ⋯ ⊗A m .  ... 
dblp:conf/edbt/Grahne15 fatcat:2eja72ddjrb47e6x3pqdolvoh4

Fast Deep Packet Inspection with a Dual Finite Automata

Cong Liu, Jie Wu
2013 IEEE transactions on computers  
However, both NFA and DFA are not ideal for real-world rule-sets: NFA has the minimum storage, but the maximum memory bandwidth; while DFA has the minimum memory bandwidth, but the maximum storage.  ...  Non-deterministic Finite Automaton (NFA) and Deterministic Finite Automaton (DFA) are the basis of existing algorithms.  ...  For software implementation, a small number of problematic NFA states means the number is not larger than the length of a computer word.  ... 
doi:10.1109/tc.2011.231 fatcat:wiyoiesurzg3nnvk32he6m7soy

Visual Exploration of Generation Algorithms for Finite Automata on the Web [chapter]

Stephan Diehl, Andreas Kerren, Torsten Weller
2001 Lecture Notes in Computer Science  
-For each of the above automata generated above, the applet can visualize the computation of the automaton on an input word.  ...  To overcome these restrictions we developed GaniFA, our Java applet for visualization of algorithms from automata theory.  ... 
doi:10.1007/3-540-44674-5_29 fatcat:5gzveeaiwzadtg4dnvpfd7fg2a

On Straight Line Segment Detection

Rafael Grompone von Gioi, Jérémie Jakubowicz, Jean-Michel Morel, Gregory Randall
2008 Journal of Mathematical Imaging and Vision  
The proposed algorithm is extensively tested on synthetic and real images and compared with the state of the art.  ...  At the core of the work lies a new way to interpret binary sequences in terms of unions of segments, for which a dynamic programming implementation is given.  ...  Many thanks to Bernard Rougé, Olivier Goretta and Wen Masters for their interest and constant support.  ... 
doi:10.1007/s10851-008-0102-5 fatcat:cvk7mdalmjbdvab3vajjf6jhia

Approximate membership for regular languages modulo the edit distance

Antoine Ndione, Aurélien Lemay, Joachim Niehren
2013 Theoretical Computer Science  
We present an efficient probabilistic algorithm for testing approximate membership of words to regular languages modulo the edit distance.  ...  Our algorithm runs in polynomial time in the size of the input automaton and the inverse error precision in contrast to all previous approaches, and independently of the size of the input word.  ...  In particular, we would like to thank Arnaud Durand, the coordinator of Enum, for having brought the authors together.  ... 
doi:10.1016/j.tcs.2013.03.004 fatcat:32exegsli5aobjzo5mzxlai5du
« Previous Showing results 1 — 15 out of 3,486 results