Context-Free Languages via Coalgebraic Trace Semantics-Reference-Cited by-同舟云学术

Context-Free Languages via Coalgebraic Trace Semantics

Published:2005 Issue: Volume: Page:213-231
ISSN:0302-9743
Container-title:Algebra and Coalgebra in Computer Science
language:
Short-container-title:

Author:

Hasuo Ichiro,Jacobs Bart

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11548133_14.pdf

Reference17 articles.

1. Aczel, P., Adáamek, J., Milius, S., Velebil, J.: Infinite trees and completely iterative theories: a coalgebraic view. Theor. Comp. Sci. 300, 1–45 (2003)

2. Adámek, J., Koubek, V.: On the greatest fixed point of a set functor. Theor. Comp. Sci. 150(1), 57–75 (1995)

3. Addison-Wesley series in Computer Science;A.V. Aho,1986

4. Barr, M.: Terminal coalgebras in well-founded set theory. Theor. Comp. Sci. 114, 299–315 (1993)

5. Bartels, F.: On Generalized Coinduction and Probabilistic Specification Formats: Distributive Laws in Coalgebraic Modelling. PhD thesis, Free Univ. Amsterdam (2004)

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

1. Categorical Büchi and Parity Conditions via Alternating Fixed Points of Functors;Coalgebraic Methods in Computer Science;2018

2. Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices;CONCUR 2014 – Concurrency Theory;2014

3. Context-Free Languages, Coalgebraically;Algebra and Coalgebra in Computer Science;2011

4. Traces, Executions and Schedulers, Coalgebraically;Algebra and Coalgebra in Computer Science;2009

5. Generic Forward and Backward Simulations;CONCUR 2006 – Concurrency Theory;2006