Filters








4,174 Hits in 3.8 sec

Shorter Regular Expressions from Finite-State Automata [chapter]

Yo-Sub Han, Derick Wood
2006 Lecture Notes in Computer Science  
We consider the use of state elimination to construct shorter regular expressions from finite-state automata.  ...  We examine the minimization of finite-state automata to obtain shorter expressions first.  ...  Introduction It is well known that the family of languages defined by finite-state automata (FAs) is the same as the family of languages described by regular expressions [1] .  ... 
doi:10.1007/11605157_12 fatcat:6at4bpxe55ce3lw426qqhkzrn4

Obtaining shorter regular expressions from finite-state automata

Yo-Sub Han, Derick Wood
2007 Theoretical Computer Science  
We consider the use of state elimination to construct shorter regular expressions from finite-state automata (FAs).  ...  Although state elimination is an intuitive method for computing regular expressions from FAs, the resulting regular expressions are often very long and complicated.  ...  Introduction It is well known that the family of languages accepted by finite-state automata (FAs) is the same as the family of languages defined by regular expressions [16] .  ... 
doi:10.1016/j.tcs.2006.09.025 fatcat:r2u5ssostbbhxddp3kp4m6igtu

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

Luis Quesada and Fernando Berzal and Francisco J. Cortijo
2011 arXiv   pre-print
Parallel Finite State Machines make very fast distributed regular expression matching in data-intensive applications feasible.  ...  Regular expressions provide a flexible means for matching strings and they are often used in data-intensive applications.  ...  The implementation of regular expression matching typically relies on deterministic finite automata (DFAs) or nondeterministic finite automata (NFAs).  ... 
arXiv:1110.1716v2 fatcat:r3hmcnnflzfplk56nxxduq5mlq

From Finite Automata to Regular Expressions and Back—A Summary on Descriptional Complexity

Hermann Gruber, Markus Holzer
2014 Electronic Proceedings in Theoretical Computer Science  
The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene on events in nerve nets and finite automata from 1956.  ...  algorithm that converts finite automata to regular expressions.  ...  From Regular Expressions to Finite Automata The conversion of regular expressions into small finite automata has been intensively studied for more than half a century.  ... 
doi:10.4204/eptcs.151.2 fatcat:xiiyglxcebbkpdklmkngqd47dm

From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity

Hermann Gruber, Markus Holzer
2015 International Journal of Foundations of Computer Science  
The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene on events in nerve nets and finite automata from 1956.  ...  algorithm that converts finite automata to regular expressions.  ...  From Regular Expressions to Finite Automata The conversion of regular expressions into small finite automata has been intensively studied for more than half a century.  ... 
doi:10.1142/s0129054115400110 fatcat:glifsfoc4jgw7cpuyxjwlwcq6a

Parsing with Neural and Finite Automata Networks: A Graph Grammar Approach

Sanjay Bhargava, G. N. Purohit
2011 International Journal of Computer Applications  
Parsing with finite automata networks implies, in one way, the conversion of a regular expression into a minimal deterministic finite automaton, while parsing with neural networks involves parsing of a  ...  In "Parsing with finite automata networks" finite automata are frequently combined using a set of rules for various operations like union, concatenation, and kleene closure; while in "Parsing with neural  ...  a minimal deterministic finite automaton from a regular expression.  ... 
doi:10.5120/2878-3747 fatcat:ikw5hpj255acpmuucnd2giv2du

PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA

HERMANN GRUBER, MARKUS HOLZER
2013 International Journal of Foundations of Computer Science  
Based on recent results from extremal graph theory, we prove that every n-state binary deterministic finite automaton can be converted into an equivalent regular expression of size O(1.742 n ) using state  ...  Furthermore, we give improved upper bounds on the language operations intersection and interleaving on regular expressions.  ...  i.e., δ(q, ε) = {q}, and Provably Shorter Regular Expressions from Finite Automata 1257 δ(q, aw) = p∈δ(q,a) δ(p, w), for q ∈ Q, a ∈ Σ, and w ∈ Σ * .  ... 
doi:10.1142/s0129054113500330 fatcat:7lb5ibrrvbcebj6tpw3b35co2e

Sequential Machines and Automata Theory

D. C. Cooper
1968 Computer journal  
After compilation the amount of time taken for execution of the program was quite short, not being more than ten minutes for a net with 8 external inputs, and very much shorter for nets with a lesser number  ...  Moreover sequential machines are defined as possibly having an infinite set of states whereas regular expressions are related to finite state automata.  ...  On p. 407 it is stated that there is a strong connection between finite state machines and finite state languages because sentences of such languages are generated from left to right; this is vague, which  ... 
doi:10.1093/comjnl/11.2.176 fatcat:dwrarlsdebamhhvef475ajls4q

Acyclic Automata with Easy-to-Find Short Regular Expressions [chapter]

José João Morais, Nelma Moreira, Rogério Reis
2006 Lecture Notes in Computer Science  
Computing short regular expressions equivalent to a given finite automaton is a hard task.  ...  In this work we present a class of acyclic automata for which it is easy to find a regular expression that has linear size. We call those automata UDR.  ...  by finite automata and languages represented by regular expressions.  ... 
doi:10.1007/11605157_33 fatcat:42jvrecm5zgyplcsmr2wwetlsi

State Elimination Ordering Strategies: Some Experimental Results

Nelma Moreira, Davide Nabais, Rogério Reis
2010 Electronic Proceedings in Theoretical Computer Science  
Algorithms for converting finite automata to regular expressions have an exponential blow-up in the worst-case. To overcome this, simple heuristic methods have been proposed.  ...  Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated.  ...  Section 3 summarizes the conversions from finite automata to regular expressions, and in particular the state elimination method.  ... 
doi:10.4204/eptcs.31.16 fatcat:rinkybhhwrhffkmhmt6o3fwele

Cryptographic Key Exchange Protocol with Message Authentication Codes (MAC) Using Finite State Machine

Mohd Anuar Mat Isa, Miza Mumtaz Ahmad, Nor Fazlida Mohd Sani, Habibah Hashim, Ramlan Mahmod
2014 Procedia Computer Science  
We have shown that the cryptographic MAC protocol for key exchange protocol can be implemented using finite input-output automata with some small modification of the finite state machine.  ...  In the final result, we combined all stages and represented the protocol as Cryptographic MAC Protocol in the regular language.  ...  Language and Regular Expression for Stage 1 * 5.2. Language and Regular Expression for Stage 2 * 5.3.  ... 
doi:10.1016/j.procs.2014.11.061 fatcat:nx6wknnztzcqrl6hhskyp5frxu

Stamina: Stabilisation Monoids in Automata Theory [chapter]

Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Denis Kuperberg
2017 Lecture Notes in Computer Science  
First, compute the star height of a regular language, i.e. the minimal number of nested Kleene stars needed for expressing the language with a complement-free regular expression.  ...  The compact data structures used in Stamina, together with optimisations and heuristics, allow us to handle automata with several hundreds of states.  ...  There are infinitely manyexpressions and finitely many matrices thus most -expressions rewrite in an equivalent and shorter way.  ... 
doi:10.1007/978-3-319-60134-2_9 fatcat:iobsny7fnfd4vj6k3duupk76fy

Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization

Marcelo Arenas, Pablo Barceló, Leonid Libkin
2010 Theory of Computing Systems  
The usual connection between monadic second-order logic (MSO) and automata extends from words to nested words and gives us a natural notion of regular languages of nested words.  ...  There are several related results on µ-calculus and MSO, e.g. their equality over infinite binary trees [20] or finite unranked trees [9] or expressive-completeness of µcalculus [16] .  ...  , EPSRC grant E005039, and by an NSERC grant while on leave from U.  ... 
doi:10.1007/s00224-010-9292-5 fatcat:za4ue7hddzdlxf7hzmp6xrdceu

Short Regular Expressions from Finite Automata: Empirical Results [chapter]

Hermann Gruber, Markus Holzer, Michael Tautschnig
2009 Lecture Notes in Computer Science  
Holzer: Provably shorter regular expressions from deterministic finite automata (extended abstract). In Proc.  ...  regular expressions.  ...  Recently improved upper bounds on the size of the regular expressions resulting from deterministic finite automata (DFA) over small alphabets were obtained [11] .  ... 
doi:10.1007/978-3-642-02979-0_22 fatcat:46b7oliwrjcinekkxnv3rvftce

REduce: Removing Redundancy from Regular Expression Matching in Network Security

Victor C. Valgenti, Min Sik Kim, Sung-Il Oh, Inbok Lee
2015 2015 24th International Conference on Computer Communication and Networks (ICCCN)  
This research, however, investigated whether or not the regular expression set itself contained any lever that might make for creating more efficient automata prior to moving such automata to any specific  ...  The end result is smaller matching automata (between 4-50% depending on the rule-set) and a 4-900% improvement in throughput due to reductions in active state.  ...  Common techniques for matching automata are to use Deterministic Finite Automata (DFA), Non-deterministic Finite Automata (NFA), or to match each regular expression adhoc using a library like Perl Compatible  ... 
doi:10.1109/icccn.2015.7288457 dblp:conf/icccn/ValgentiKOL15 fatcat:vc2lbbie7zauvadit7hgbbcwc4
« Previous Showing results 1 — 15 out of 4,174 results