PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA (Q5168416): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Large induced degenerate subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rankings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivatives of Regular Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarization and fragmentability of some classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transition graphs and the star-height of regular events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity measures for regular expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Minimum Weight Vertex Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinctness of regular expressions with interleaving, intersection and counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinctness of the Complement and Intersection of Regular Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: S-functions for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining shorter regular expressions from finite-state automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Follow automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-depth, subgraph coloring and homomorphism bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0129054113500330 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2113629662 / rank
 
Normal rank

Latest revision as of 08:42, 30 July 2024

scientific article; zbMATH DE number 6313574
Language Label Description Also known as
English
PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA
scientific article; zbMATH DE number 6313574

    Statements

    PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA (English)
    0 references
    0 references
    0 references
    4 July 2014
    0 references
    regular expression
    0 references
    state elimination
    0 references
    cycle rank
    0 references
    intersection
    0 references
    interleaving
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references