On regular tree languages and deterministic pushdown automata
From MaRDI portal
Publication:1037619
DOI10.1007/S00236-009-0104-9zbMATH Open1186.68260OpenAlexW2086821293MaRDI QIDQ1037619FDOQ1037619
Authors: 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
Recommendations
- scientific article; zbMATH DE number 2150292
- scientific article; zbMATH DE number 1494251
- scientific article; zbMATH DE number 54244
- THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES
- Deterministic tree pushdown automata and monadic tree rewriting systems
- Deciding top-down determinism of regular tree languages
- Tree pushdown automata
- A Characterisation of Pi^0_2 Regular Tree Languages
- PUSHDOWN AUTOMATA ON INFINITE TREES AND NONDETERMINISTIC CONTEXT-FREE PROGRAMS
- Regular languages of thin trees
Cites Work
- YakYak: Parsing with logical side constraints
- Title not available (Why is that?)
- Visibly pushdown languages
- Title not available (Why is that?)
- Jewels of Stringology
- Optimization of LR(k) parsers
- Pattern Matching in Trees
- Title not available (Why is that?)
- A new algorithm for linear regular tree pattern matching
- Parallel and two-way automata on directed ordered acyclic graphs
- Marrying Words and Trees
- Tree automata for code selection
- Even faster generalized LR parsing
- Attribute grammars, applications and systems. International summer school SAGA, Prague, Czechoslovakia, June 4-13, 1991. Proceedings
- Attribute grammars and their applications. International conference WAGA, Paris, France, 19-21 Sept. 1990. Proceedings
- Bottom-up tree acceptors
Cited In (16)
- PUSHDOWN AUTOMATA ON INFINITE TREES AND NONDETERMINISTIC CONTEXT-FREE PROGRAMS
- Tree template matching in unranked ordered trees
- Implementation and Application of Automata
- DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES
- It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton
- Arbology: trees and pushdown automata
- Regular languages of thin trees
- Deterministic tree pushdown automata and monadic tree rewriting systems
- Title not available (Why is that?)
- Tree template matching in ranked ordered trees by pushdown automata
- Tree template matching in ranked ordered trees by pushdown automata
- Title not available (Why is that?)
- Simple tree pattern matching for trees in the prefix bar notation
- Largest common prefix of a regular tree language
- Title not available (Why is that?)
- THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES
Uses Software
This page was built for publication: On regular tree languages and deterministic pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1037619)
