From regular expressions to deterministic automata

JOURNAL ARTICLE published 1986 in Theoretical Computer Science

Authors: Gerard Berry | Ravi Sethi

A note on non-singular deterministic pushdown automata

JOURNAL ARTICLE published December 1978 in Theoretical Computer Science

Authors: Emily P. Friedman

Closure properties and descriptional complexity of deterministic regular expressions

JOURNAL ARTICLE published May 2016 in Theoretical Computer Science

Research funded by Deutsche Forschungsgemeinschaft (MA 4938/2-1)

Authors: Katja Losemann | Wim Martens | Matthias Niewerth

An extended direct branching algorithm for checking equivalence of deterministic pushdown automata

JOURNAL ARTICLE published 1984 in Theoretical Computer Science

Authors: Etsuji Tomita

Deterministic top-down tree automata with Boolean deterministic look-ahead

JOURNAL ARTICLE published August 2022 in Theoretical Computer Science

Authors: Sándor Vágvölgyi

Quasi-rocking real-time pushdown automata

JOURNAL ARTICLE published November 2011 in Theoretical Computer Science

Authors: Changwook Kim

Optimal Regular Tree Pattern Matching Using Pushdown Automata

BOOK CHAPTER published 1998 in Lecture Notes in Computer Science

Authors: Maya Madhavan | Priti Shankar

Further closure properties of input-driven pushdown automata

JOURNAL ARTICLE published December 2019 in Theoretical Computer Science

Research funded by Russian Science Foundation (18-11-00100)

Authors: Alexander Okhotin | Kai Salomaa

Regular expressions into finite automata

JOURNAL ARTICLE published November 1993 in Theoretical Computer Science

Authors: Anne Brüggemann-Klein

The size-cost of Boolean operations on constant height deterministic pushdown automata

JOURNAL ARTICLE published August 2012 in Theoretical Computer Science

Authors: Zuzana Bednárová | Viliam Geffert | Carlo Mereghetti | Beatrice Palano

Hyper-optimization for deterministic tree automata

JOURNAL ARTICLE published May 2015 in Theoretical Computer Science

Research funded by DFG (MA 4959/1-1)

Authors: Andreas Maletti

On modification of Boyer-Moore-horspool's algorithm for tree pattern matching in linearised trees

JOURNAL ARTICLE published August 2020 in Theoretical Computer Science

Research funded by MEYS (CZ.02.1.01/0.0/0.0/16_019/0000765) | National Research Foundation (29725)

Authors: Jan Trávníček | Jan Janoušek | Bořivoj Melichar | Loek Cleophas

An Intersection Type System for Deterministic Pushdown Automata

BOOK CHAPTER published 2012 in Lecture Notes in Computer Science

Authors: Takeshi Tsukada | Naoki Kobayashi

Decidability of equivalence for deterministic synchronized tree automata

JOURNAL ARTICLE published 1996 in Theoretical Computer Science

Authors: Kai Salomaa

Bottom-up tree pushdown automata: classification and connection with rewrite systems

JOURNAL ARTICLE published May 1994 in Theoretical Computer Science

Authors: Jean-Luc Coquidé | Max Dauchet | Rémi Gilleron | Sándor Vágvölgyi

Embedding finite automata within regular expressions

JOURNAL ARTICLE published September 2008 in Theoretical Computer Science

Authors: Shoham Ben-David | Dana Fisman | Sitvanit Ruah

Decision Problems for Deterministic Pushdown Automata on Infinite Words

JOURNAL ARTICLE published 21 May 2014 in Electronic Proceedings in Theoretical Computer Science

Authors: Christof Löding

Obtaining shorter regular expressions from finite-state automata

JOURNAL ARTICLE published February 2007 in Theoretical Computer Science

Authors: Yo-Sub Han | Derick Wood

Lower bounds for the size of deterministic unranked tree automata

JOURNAL ARTICLE published October 2012 in Theoretical Computer Science

Authors: Xiaoxue Piao | Kai Salomaa

Pushdown automata, multiset automata, and Petri nets

JOURNAL ARTICLE published April 2001 in Theoretical Computer Science

Authors: Yoram Hirshfeld | Faron Moller