THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS (Q2909093): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient simulation of finite automata by neural nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial derivatives of regular expressions and finite automaton constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: From regular expressions to deterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rankings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular expressions into finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivatives of Regular Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: NORMALIZED EXPRESSIONS AND FINITE AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity measures for regular expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Procedure for Checking Equality of Regular Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE ABSTRACT THEORY OF AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language operations with regular expressions of polynomial size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing<i>ϵ</i>-Free NFA from Regular Expressions in<i>O</i>(<i>n</i>log<sup>2</sup>(<i>n</i>)) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for determining relative star height and star height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Follow automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the space complexity of some decision problems for finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of restricted regular expressions and the synthesis problem for finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the size of \(\varepsilon\)-free NFA corresponding to a regular expression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical calculus of the ideas immanent in nervous activity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The loop complexity of pure-group events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Techniques: Regular expression search algorithm / rank
 
Normal rank

Latest revision as of 15:25, 5 July 2024

scientific article
Language Label Description Also known as
English
THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS
scientific article

    Statements

    THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS (English)
    0 references
    0 references
    0 references
    29 August 2012
    0 references
    0 references
    regular expressions
    0 references
    finite automata
    0 references
    transformations
    0 references
    descriptional complexity
    0 references
    computational complexity
    0 references
    formal language problems
    0 references
    operation problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references