Implementation and Application of Automata

DOI10.1007/11605157zbMATH Open1172.68506OpenAlexW2544597226MaRDI QIDQ5897671FDOQ5897671

Authors: Akio Fujiyoshi, Ikuo Kawaharada 

Publication date: 13 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11605157

Recommendations

• On regular tree languages and deterministic pushdown automata
• scientific article; zbMATH DE number 3843161
• An NC algorithm for recognizing tree adjoining languages
• Tree compression pushdown automaton
• Tree-Adjoining Language Parsing in $O(n^6 )$ Time

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (4)

• An NC algorithm for recognizing tree adjoining languages
• Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata
• Recognition of directed acyclic graphs by spanning tree automata
• Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees

This page was built for publication: Implementation and Application of Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897671)