- T(A) = T(B) Géraud Sénizergues Thu 04 October 2018
- L(A) = L(B) Géraud Sénizergues Thu 04 October 2018
- The equivalence problem for deterministic pushdown automata is decidable Géraud Sénizergues Thu 04 October 2018
- Bottom-up rewriting for words and terms I. Durand G. Sénizergues Thu 04 October 2018
- The Algebraic Theory of Parikh Automata Michael Cadilhac Andreas Krebs Pierre McKenzie Thu 04 October 2018
- Review of: The Golden Ratio and Fibonacci Numbers by Richard A. Dunlap Michael Cadilhac Thu 04 October 2018
- Equivalence problems for deterministic context-free languages and monadic recursion schemes Emily P. Friedman Thu 04 October 2018
- Deciding Equivalence of Finite Tree Automata Helmut Seidl Wed 03 October 2018
- Recursive Markov Decision Processes and Recursive Stochastic Games Kousha Etessami Mihalis Yannakakis Tue 02 October 2018
- A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes K. Etessami A. Stewart M. Yannakakis Tue 02 October 2018
- Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes Kousha Etessami Alistair Stewart Mihalis Yannakakis Tue 02 October 2018
- Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata Alistair Stewart Kousha Etessami Mihalis Yannakakis Tue 02 October 2018
- Efficient Polynomial Equation Solving: Algorithms and Complexity Juan Sabia Tue 02 October 2018
- Computation of Infix Probabilities for Probabilistic Context-free Grammars Mark-Jan Nederhof Giorgio Satta Tue 02 October 2018
- Computing Partition Functions of PCFGs Mark-Jan Nederhof Giorgio Satta Tue 02 October 2018
- Statistical Properties of Probabilistic Context-free Grammars Zhiyi Chi Tue 02 October 2018
- Relating Probabilistic Grammars and Automata Steven Abney David McAllester Fernando Pereira Mon 01 October 2018
- Weighted and Probabilistic Context-Free Grammars Are Equally Expressive Noah A. Smith Mark Johnson Mon 01 October 2018
- Computing the Least Fixed Point of Positive Polynomial Systems Javier Esparza Stedan Kiefer Michael Luttenberger Mon 01 October 2018
- The Containment Problem for Unambiguous Register Automata A. Mottet K. Quaas Mon 01 October 2018
Library Size: 13G (12979 entries),
Last Updated: Apr 21, 2026, 15:38:46,
Build Time: N/A
