A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets-Reference-Cited by-同舟云学术

A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets

Published:2001 Issue: Volume: Page:443-454
ISSN:0302-9743
Container-title:STACS 2001
language:
Short-container-title:

Author:

Kuske Dietrich

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44693-1_39

Reference19 articles.

1. B. Courcelle. The monadic second-order logic of graphs. I: Recognizable sets of finite graphs. Information and Computation, 85:12–75, 1990.

2. B. Courcelle and J.A. Makowsky. VR and HR graph grammars: A common algebraic framework compatible with monadic second order logic. In Graph transformations, 2000. cf. http://tfs.cs.tu-berlin.de/gratra2000/proceedings.html .

3. J. Doner. Tree acceptors and some of their applications. J. Comput. Syst. Sci., 4:406–451, 1970.

4. M. Droste and P. Gastin. Asynchronous cellular automata for pomsets without autoconcurrency. In CONCUR’96, Lecture Notes in Comp. Science vol. 1119, pages 627–638. Springer, 1996.

5. M. Droste and D. Kuske. Logical definability of recognizable and aperiodic languages in concurrency monoids. In Computer Science Logic, Lecture Notes in Comp. Science vol. 1092, pages 467–478. Springer, 1996.

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

1. Algebraic and graph-theoretic properties of infiniten-posets;RAIRO - Theoretical Informatics and Applications;2005-01

2. Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable;Developments in Language Theory;2002

3. Rationality in Algebras with a Series Operation;Information and Computation;2001-12