The solutions of two star-height problems for regular trees
From MaRDI portal
Publication:760212
DOI10.1016/0304-3975(84)90063-XzbMATH Open0554.68037OpenAlexW2054822300MaRDI QIDQ760212FDOQ760212
Authors: J. P. Braquelaire, Bruno Courcelle 
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(84)90063-x
Recommendations
- scientific article; zbMATH DE number 3917723
- Some results on the generalized star-height problem
- Some Variants of the Star Height Problem
- An algorithmic framework for the exact solution of tree-star problems
- The \(p\)-arborescence star problem: formulations and exact solution approaches
- The tree-star problem: a formulation and a branch-and-cut algorithm
- The 2-radius and 2-radiian problems on trees
- On trees as star complements in regular graphs
- Some results on symmetric double starlike trees
- On characteristic functions of equilateral regular star-trees
Formal languages and automata (68Q45) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the algebraic structure of rooted trees
- Fundamental properties of infinite trees
- Regular trees and the free iterative theory
- Transition graphs and the star-height of regular events
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- A representation of trees by languages. II
- The existence and construction of free iterative theories
- Title not available (Why is that?)
- An algebraic definition for control structures
- General properties of star height of regular events
- Star height of certain families of regular events
- The loop complexity of pure-group events
- Techniques for establishing star height of regular sets
- Rank-non-increasing transformations on transition graphs
Cited In (9)
- Title not available (Why is that?)
- Type inference with recursive types: Syntax and semantics
- Some Variants of the Star Height Problem
- Algorithms for determining relative star height and star height
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Unification and combination of a class of traversal strategies made with pattern matching and fixed-points
- The variable hierarchy for the games \(\mu \)-calculus
- Algorithms for determining relative inclusion star height and inclusion star height
- Title not available (Why is that?)
This page was built for publication: The solutions of two star-height problems for regular trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760212)
