- Two Results on Discontinuous Input Processing Vojtěch Vorel Thu 12 January 2017
- The Universe Problem for Unrestricted Flow Languages Kazuo Iwama Thu 12 January 2017
- Characterization and Complexity Results on Jumping Finite Automata Henning Fernau Meenakshi Paramasivan Markus L. Schmid Vojtěch Vorel Thu 12 January 2017
- On universality of concurrent expressions with synchronization primitives T. Ito Y. Nishitani Thu 12 January 2017
- Descriptional Complexity of Alternating Finite Automata J. Kavitha L. Jeganathan G. Sethuraman Thu 12 January 2017
- State Complexity of Combined Operations on Alternating Finite Automata Kavitha Joseph Thu 12 January 2017
- Extension orderings revisited Jean-Pierre Jouannaud Wed 11 January 2017
- Better-quasi-orderings and Coinduction Thomas Forster Wed 11 January 2017
- Minimization of Tree Pattern Queries Wojciech Czerwinski Wim Martens Matthias Niewerth Pawel Parys Wed 11 January 2017
- Validity of Tree Pattern Queries with Respect to Schema Information Henrik Bjørklund Wim Martens Thomas Schwentick Wed 11 January 2017
- Taxonomy of XML Schema Languages Using Formal Language Theory Makoto Murata Dongwon Lee Murali Mani Kohsuke Kawaguchi Wed 11 January 2017
- Succinctness of Regular Expressions with Interleaving, Intersection and Counting Wouter Gelade Wed 11 January 2017
- Analyzing Timed Systems Using Tree Automata S. Akshay Paul Gastin Shankara Narayanan Krishna Tue 10 January 2017
- Concurrent Regular Expressions and Their Relationship to Petri Nets Vijay K. Garg M. T. Ragunath Tue 10 January 2017
- Derivatives and partial derivatives for regular shuffle expressions Martin Sulzmann Peter Thiemann Tue 10 January 2017
- Forkable Regular Expressions Martin Sulzmann Peter Thiemann Tue 10 January 2017
- A Survey on Operational State Complexity Yuan Gao Nelma Moreira Rogério Reis Sheng Yu Tue 10 January 2017
- On the State Complexity of Combined Operations Sheng Yu Tue 10 January 2017
- Shuffle languages, Petri nets, and context-sensitive grammars Jay Gischer Tue 10 January 2017
- Descriptional and computational complexity of finite automata---A survey Markus Holzer Martin Kutrib Tue 10 January 2017
Library Size: 13G (12984 entries),
Last Updated: Apr 23, 2026, 21:48:37,
Build Time: N/A
