- The categorical contours of the Chomsky-Schutzenberger representation theorem Paul-André Melliès Noam Zeilberger Sat 20 January 2024
- On solving cycle-free context-free grammar equivalence problem using numerical analysis José João Almeida Eliana Grande Georgi Smirnov Fri 09 June 2023
- A lower bound for the coverability problem in acyclic pushdown VAS Matthias Englert Piotr Hofman Sławomir Lasota Ranko Lazić Jérôme Leroux Juliusz Straszyński Sun 27 December 2020
- Coefficients of algebraic functions: formulae and asymptotics Cyril Banderier Michael Drmota Sun 18 October 2020
- Epsilon-reducible context-free languages and characterizations of indexed languages Séverine Fratani El Makki Voundy Sat 31 August 2019
- Operational State Complexity under Parikh Equivalence Giovanna J. Lavado Giovanni Pighizzini Shinnosuke Seki Mon 23 November 2015
- Parikh Images of Grammars: Complexity and Applications Eryk Kopczyński Anthony Widjaja To Thu 08 January 2015
- Verification of context-free timed systems using linear hybrid observers Ahmed Bouajjani Rachid Echahed Riadh Robbana Wed 22 October 2014
- Parikh's Theorem: A simple and direct automaton construction Javier Esparza Pierre Ganty Stefan Kiefer Michael Luttenberger Wed 25 September 2013
- Recognition and parsing of context-free languages in time n3 Daniel H. Younger Mon 08 April 2013
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory J. W. Thatcher Mon 01 April 2013
Library Size: 13G (11 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
