On regular tree languages and deterministic pushdown automata
From MaRDI portal
Publication:1037619
DOI10.1007/s00236-009-0104-9zbMath1186.68260OpenAlexW2086821293MaRDI QIDQ1037619
Jan Janoušek, Bořivoj Melichar
Publication date: 16 November 2009
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-009-0104-9
Related Items (5)
Tree template matching in ranked ordered trees by pushdown automata ⋮ Tree template matching in unranked ordered trees ⋮ Simple tree pattern matching for trees in the prefix bar notation ⋮ Tree Template Matching in Ranked Ordered Trees by Pushdown Automata ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Attribute grammars and their applications. International conference WAGA, Paris, France, 19-21 Sept. 1990. Proceedings
- Attribute grammars, applications and systems. International summer school SAGA, Prague, Czechoslovakia, June 4-13, 1991. Proceedings
- Bottom-up tree acceptors
- Tree automata for code selection
- A new algorithm for linear regular tree pattern matching
- Optimization of LR(k) parsers
- Marrying Words and Trees
- Visibly pushdown languages
- Pattern Matching in Trees
- Parallel and two-way automata on directed ordered acyclic graphs
- Jewels of Stringology
- Even faster generalized LR parsing
This page was built for publication: On regular tree languages and deterministic pushdown automata
