Working Group LSV INFINI 2010

Flash presentation of Groupe de Travail INFINI

References used in this presentation

• Parikh Images of Grammars: Complexity and Applications. E. Kopczynski and A.W. To: LICS'10. It's a merging version of two independent submissions: here is the initial submissions of Kopczynski and To.
• On Context-Free Languages. R. Parikh: 1966
• Petri Nets, Commutative Context-Free Grammars and Basic Parallel Processes. J. Esparza: 1997
• Reversal-Bounded Multicounter Machines and Their Decision Problems. O.H. Ibarra: 1978
• Automata and Computability. D. C. Kozen (p.201...)
• On the Complexity of Equational Horn Clauses. K.N. Verma, H. Seidl, T. Schwentick: CADE'05
• Binary Reachability Analysis of Discrete Pushdown Timed Automata. Z.Dang, O.H. Ibarra, T. Bultan, R. Kemmerer, J. Su: CAV'00