default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 578
Volume 578, May 2015
- Stavros Konstantinidis
:
Implementation and Application of Automata (CIAA 2013). 1
- Eric Balkanski, Francine Blanchet-Sadri, Matthew Kilgore, Benjamin J. Wyatt:
On the state complexity of partial word DFAs. 2-12 - Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot:
Trimming visibly pushdown automata. 13-29 - Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compressed automata for dictionary matching. 30-41 - Jozef Jirásek, Galina Jirásková:
On the boundary of regular languages. 42-57 - Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt:
Deterministic input-driven queue automata: Finite turns, decidability, and closure properties. 58-71 - Andreas Maletti:
Hyper-optimization for deterministic tree automata. 72-87 - Friedrich Otto, Frantisek Mráz:
Lambda-confluence for context rewriting systems. 88-99 - Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, Mohamed Zergaoui:
Early nested word automata for XPath query answering on XML streams. 100-125
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
