The solutions of two star-height problems for regular trees
From MaRDI portal
Publication:760212
DOI10.1016/0304-3975(84)90063-XzbMath0554.68037MaRDI QIDQ760212
Bruno Courcelle, J. P. Braquelaire
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
05C05: Trees
68Q45: Formal languages and automata
68R10: Graph theory (including graph drawing) in computer science
Related Items
Type inference with recursive types: Syntax and semantics, Equivalences and transformations of regular systems - applications to recursive program schemes and grammars, Algorithms for determining relative star height and star height, Algorithms for determining relative inclusion star height and inclusion star height
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamental properties of infinite trees
- A representation of trees by languages. II
- An algebraic definition for control structures
- Regular trees and the free iterative theory
- The existence and construction of free iterative theories
- On the algebraic structure of rooted trees
- Transition graphs and the star-height of regular events
- General properties of star height of regular events
- Star height of certain families of regular events
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- The loop complexity of pure-group events
- Techniques for establishing star height of regular sets
- Rank-non-increasing transformations on transition graphs
