- An extension of Zeilbergertextquotesingles fast algorithm to general holonomic functions Frédéric Chyzak Fri 02 March 2012
- On the definition of a family of automata Marcel-Paul Schützenberger Fri 02 March 2012
- Probabilistic automata Michael O. Rabin Fri 02 March 2012
- A characterization of parenthesis languages Donald E. Knuth Fri 02 March 2012
- The minimalization of tree automata Walter S. Brainerd Fri 02 March 2012
- Time and tape complexity of pushdown automaton languages A.V. Aho J.E. Hopcroft J.D. Ullman Fri 02 March 2012
- Full AFLs and nested iterated substitution Sheila A. Greibach Fri 02 March 2012
- Properties of deterministic top-down grammars D.J. Rosenkrantz R.E. Stearns Fri 02 March 2012
- A few remarks on the index of context-free grammars and languages J. Gruska Fri 02 March 2012
- Two-way sequential transductions and stack automata R.W. Ehrich S.S. Yau Fri 02 March 2012
- Translations on a context free grammar A.V. Aho J.D. Ullman Fri 02 March 2012
- Language recognition by marking automata R.W. Ritchie F.N. Springsteel Fri 02 March 2012
- Parsing algorithms with backtrack Alexander Birman Jeffrey D. Ullman Fri 02 March 2012
- The equivalence problem for deterministic finite-turn pushdown automata Leslie G. Valiant Fri 02 March 2012
- Bounded context parsable grammars John H. Williams Fri 02 March 2012
- A note on the succinctness of descriptions of deterministic languages Leslie G. Valiant Fri 02 March 2012
- The decidability of the equivalence problem for DOL-systems K. Culik I. Fris Fri 02 March 2012
- Star-free regular sets of ømega-sequences Wolfgang Thomas Fri 02 March 2012
- Parallel and two-way automata on directed ordered acyclic graphs Tsutomu Kamimura Giora Slutzki Fri 02 March 2012
- The characterization of nonexpansive grammars by rational power series Gerd Baron Werner Kuich Fri 02 March 2012
Library Size: 13G (12947 entries),
Last Updated: Apr 09, 2026, 18:14:57,
Build Time: N/A
