- Exponential Determinization for ømegaAutomata with a Strong Fairness Acceptance Condition S. Safra Fri 16 May 2014
- Tree-oriented Proofs of Some Theorems on Context-free and Indexed Languages William C. Rounds Tue 06 May 2014
- The Equivalence Problem for Real-time DPDAs Michio Oyamaguchi Fri 27 December 2013
- Automatic presentations of structures Bakhadyr Khoussainov Anil Nerode Tue 24 December 2013
- On formal properties of simple phrase structure grammars Yehoshua Bar-Hillel Micha A. Perles Eli Shamir Wed 18 December 2013
- On a Decision Method in Restricted Second-Order Arithmetic Julius R. Buchi Thu 12 December 2013
- Indexed Grammars - An Extension of Context-Free Grammars Alfred V. Aho Tue 10 December 2013
- The logical schemes of algorithms Iu Ianov Mon 02 December 2013
- The Complexity of the Finite Containment Problem for Petri Nets Ernst W. Mayr Albert R. Meyer Tue 05 November 2013
- A partial solution to the reachability-problem for vector-addition systems Jan van Leeuwen Mon 04 November 2013
- Model checking rationally restricted right closures of recognizable graphs Olaf Burkart Mon 22 July 2013
- Coercion and type inference John C. Mitchell Wed 17 July 2013
- Efficient Closure Analysis with Reachability A. E. Ayers Wed 10 July 2013
- A Machine-Oriented Logic Based on the Resolution Principle J. A. Robinson Tue 09 July 2013
- Recursion schemes and recursive programs are exponentially hard to analyze III H B Hunt D J Rosenkrantz Wed 03 July 2013
- Deciding ML typability is complete for deterministic exponential time Harry G. Mairson Thu 27 June 2013
- A categorical understanding of environment machines Andrea Asperti Wed 26 June 2013
- Equality between Functionals Revisited R. Statman Mon 24 June 2013
- Fully abstract models of the lazy lambda calculus C.-H. L. Ong Sat 18 May 2013
- Functional Characters of Solvable Terms M. Coppo M. Dezani Ciancaglini B. Venneri Tue 02 April 2013
- Checking a large routine A. Turing Wed 27 March 2013
- Specification and Design of (Parallel) Programs Cliff B. Jones Wed 30 January 2013
- Basic WQO- and BQO-Theory E.C. Milner Sat 29 December 2012
- Applications of Well Quasi-Ordering and Better Quasi-Ordering M. Pouzet Sat 29 December 2012
- A regularity condition for parallel rewriting systems Jan van Leeuwen Sat 29 December 2012
- Formal verification of parallel programs Robert M. Keller Sat 29 December 2012
- The Logic of Automata---Part II Arthur W. Burks Hao Wang Sat 29 December 2012
- The Logic of Automata---Part I Arthur W. Burks Hao Wang Sat 29 December 2012
- Subgraphs and well-quasi-ordering Guoli Ding Tue 18 December 2012
- The Theory of Automata, a Survey Robert McNaughton Mon 10 December 2012
- Protocol Description and Analysis Based on a State Transition Model with Channel Expressions Jan K. Pachl Wed 04 July 2012
Library Size: 13G (31 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
