Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A new algorithm for linear regular tree pattern matching

From MaRDI portal
Publication:1575543
Jump to:navigation, search

DOI10.1016/S0304-3975(98)00205-9zbMath0944.68096MaRDI QIDQ1575543

Amitranjan Gantait, A. R. Yuvaraj, Maya Madhavan, Priti Shankar

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)


zbMATH Keywords

regular tree grammarstree pattern matchingretargetable code generation


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Formal languages and automata (68Q45)


Related Items (6)

Tree template matching in ranked ordered trees by pushdown automata ⋮ Tree template matching in unranked ordered trees ⋮ A predictive bottom-up parser ⋮ Tree Template Matching in Ranked Ordered Trees by Pushdown Automata ⋮ Unnamed Item ⋮ On regular tree languages and deterministic pushdown automata



Cites Work

  • Unnamed Item
  • Tree automata for code selection
  • Pattern Matching in Trees
  • Faster tree pattern matching




This page was built for publication: A new algorithm for linear regular tree pattern matching

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1575543&oldid=13857947"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 01:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki