On infinite transition graphs having a decidable monadic theory-Reference-Cited by-同舟云学术

On infinite transition graphs having a decidable monadic theory

Published:2003-01 Issue:1 Volume:290 Page:79-115
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Caucal Didier

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference19 articles.

1. L. Boasson, M. Nivat, Centers of context-free languages, Internal Report LITP 84–44, 1984.

2. R. Büchi, Regular canonical systems, Archiv für Mathematische Logik und Grundlagenforschung 6 (1964) 91–111 [reprinted in: S. Mac Lane, D. Siefkes (Eds.), The collected works of J. Richard Büchi, Springer, New York, 1990, pp. 317–337].

3. D. Caucal, On the regular structure of prefix rewriting, CAAP 90, in: A. Arnold (Ed.), Lecture Notes in Computer Science, Vol. 431, Springer, Berlin, 1990, pp. 87–102 [a full version is in Theoret. Comput. Sci. 106 (1992) 61–86].

4. D. Caucal, Monadic theory of term rewritings, 7th IEEE Symposium, LICS 92, 1992, pp. 266–273.

5. D. Caucal, Bisimulation of context-free grammars and of pushdown automata, in: A. Ponse, M. de Rijke, Y. Venema (Eds.), CSLI Vol. 53, Modal Logic and Process Algebra, Stanford, 1995, pp. 85–106.

Cited by 47 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Shelah-Stupp’s and Muchnik’s Iterations Revisited;Computer Science – Theory and Applications;2021

2. Epsilon-reducible context-free languages and characterizations of indexed languages;Information and Computation;2019-12

3. Relating Paths in Transition Systems;ACM Transactions on Computational Logic;2018-07-31

4. Shelah-Stupp’s Iteration and Muchnik’s Iteration;Fundamenta Informaticae;2018-03-21

5. Generalizing input-driven languages: Theoretical and practical benefits;Computer Science Review;2018-02