Finite Automata, Digraph Connectivity, and Regular Expression Size (Q3520302): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: DAG-Width and Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic for Programming, Artificial Intelligence, and Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inherently nonplanar automata / 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: Q5437181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Automata, Digraph Connectivity, and Regular Expression Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Lower Bounds on Regular Expression Size Using Communication Complexity / 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: Follow automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance desert automata and the star height problem / 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: Tree-depth, subgraph coloring and homomorphism bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: DAG-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and Application of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Expressions and NFAs Without ε-Transitions / rank
 
Normal rank

Latest revision as of 13:56, 28 June 2024

scientific article
Language Label Description Also known as
English
Finite Automata, Digraph Connectivity, and Regular Expression Size
scientific article

    Statements

    Finite Automata, Digraph Connectivity, and Regular Expression Size (English)
    0 references
    0 references
    0 references
    19 August 2008
    0 references

    Identifiers

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