Series parallel digraphs with loops (Q372966): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-012-9409-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W17492227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for series parallel graphs and graphs with treewidth two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of Glushkov automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata and unary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374865 / 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: A characterization of Thompson digraphs. / 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: An Optimal Construction of Finite Automata from Regular Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113714 / 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: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Series-Parallel Automata and Short Regular Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On theories with a combinatorial definition of 'equivalence' / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank

Latest revision as of 23:53, 6 July 2024

scientific article
Language Label Description Also known as
English
Series parallel digraphs with loops
scientific article

    Statements

    Series parallel digraphs with loops (English)
    0 references
    0 references
    21 October 2013
    0 references
    digraphs
    0 references
    regular expressions
    0 references
    forbidden subgraphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references