Theμ-calculus alternation-depth hierarchy is strict on binary trees

Article Properties
Cite
Arnold, André. “Theμ-Calculus Alternation-Depth Hierarchy Is Strict on Binary Trees”. RAIRO - Theoretical Informatics and Applications, vol. 33, no. 4-5, 1999, pp. 329-3, https://doi.org/10.1051/ita:1999121.
Arnold, A. (1999). Theμ-calculus alternation-depth hierarchy is strict on binary trees. RAIRO - Theoretical Informatics and Applications, 33(4-5), 329-339. https://doi.org/10.1051/ita:1999121
Arnold A. Theμ-calculus alternation-depth hierarchy is strict on binary trees. RAIRO - Theoretical Informatics and Applications. 1999;33(4-5):329-3.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
You May Also Like
Refrences
Title Journal Journal Categories Citations Publication Date
10.1007/BFb0028547 1998
10.1016/S0304-3975(97)00039-X Theoretical Computer Science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 1997
10.1007/3-540-61604-7_58 1996
10.1007/3-540-61440-0_119 1996
10.1016/0304-3975(92)90076-R Theoretical Computer Science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 1992
Refrences Analysis
Category Category Repetition
Science: Mathematics: Instruments and machines: Electronic computers. Computer science11
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software7
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware6
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods1
The category Science: Mathematics: Instruments and machines: Electronic computers. Computer science 11 is the most frequently represented among the references in this article. It primarily includes studies from Theoretical Computer Science The chart below illustrates the number of referenced publications per year.
Refrences used by this article by year
Citations
Title Journal Journal Categories Citations Publication Date
The μ-Calculus Alternation Depth Hierarchy is infinite over finite planar graphs Theoretical Computer Science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 1 2018
Alternation Is Strict For Higher-Order Modal Fixpoint Logic Electronic Proceedings in Theoretical Computer Science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 2016
The Arity Hierarchy in the Polyadic μ-Calculus Electronic Proceedings in Theoretical Computer Science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 2015
The μ-calculus alternation hierarchy collapses over structures with restricted connectivity Theoretical Computer Science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 2 2014
Automata column

 ACM SIGLOG News 1 2014
Citations Analysis
Category Category Repetition
Science: Mathematics: Instruments and machines: Electronic computers. Computer science14
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software9
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware9
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods3
Science: Mathematics2
The category Science: Mathematics: Instruments and machines: Electronic computers. Computer science 14 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Fixpoint alternation: arithmetic, transition systems, and the binary tree and was published in 1999. The most recent citation comes from a 2018 study titled The μ-Calculus Alternation Depth Hierarchy is infinite over finite planar graphs. This article reached its peak citation in 2012, with 3 citations. It has been cited in 8 different journals, 12% of which are open access. Among related journals, the Theoretical Computer Science cited this research the most, with 5 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year