# Antoine Meyer

According to our database

Collaborative distances :

^{1}, Antoine Meyer authored at least 21 papers between 2004 and 2012.Collaborative distances :

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2012

Counting CTL

Logical Methods in Computer Science, 2012

2010

Counting LTL.

Proceedings of the TIME 2010, 2010

Counting CTL.

Proceedings of the Foundations of Software Science and Computational Structures, 2010

2009

On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata.

Journal of Automata, Languages and Combinatorics, 2009

2008

Traces of term-automatic graphs.

ITA, 2008

Winning Regions of Higher-Order Pushdown Games.

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata.

Proceedings of the Computer Science, 2008

2007

A logic of reachable patterns in linked data-structures.

J. Log. Algebr. Program., 2007

On Term Rewriting Systems Having a Rational Derivation

CoRR, 2007

Symbolic Reachability Analysis of Higher-Order Context-Free Processes

CoRR, 2007

A Logic of Reachable Patterns in Linked Data-Structures

CoRR, 2007

Linearly bounded infinite graphs

CoRR, 2007

Traces of Term-Automatic Graphs.

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

Context-Sensitive Languages, Rational Graphs and Determinism.

Logical Methods in Computer Science, 2006

Context-Sensitive Languages, Rational Graphs and Determinism

CoRR, 2006

Linearly bounded infinite graphs.

Acta Inf., 2006

A Logic of Reachable Patterns in Linked Data-Structures.

Proceedings of the Foundations of Software Science and Computation Structures, 2006

2005

Graphes infinis de présentation finie. (Finitely Presented Infinite Graphs).

PhD thesis, 2005

Linearly Bounded Infinite Graphs.

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004

Symbolic Reachability Analysis of Higher-Order Context-Free Processes.

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

On Term Rewriting Systems Having a Rational Derivation.

Proceedings of the Foundations of Software Science and Computation Structures, 2004