Nested Sibling Tree Automata
From MaRDI portal
Publication:3625699
DOI10.1051/ITA/2009006zbMATH Open1171.68020OpenAlexW2115109411MaRDI QIDQ3625699FDOQ3625699
Authors: F. Gire, Jean-Marc Talbot
Publication date: 6 May 2009
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2009__43_2_379_0/
Recommendations
Cites Work
- Visibly pushdown languages
- Title not available (Why is that?)
- A fixpoint calculus for local and global program flows
- Languages of Nested Trees
- Tree automata with one memory set constraints and cryptographic protocols
- Tree Automata with Memory, Visibility and Structural Constraints
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Automata, Languages and Programming
Cited In (1)
This page was built for publication: Nested Sibling Tree Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3625699)