Visibly recursive automata

DOI10.1007/978-3-032-28404-4_15MaRDI QIDQ7356300zbMATH OpenFDO

Authors Kévin Dubrulle, Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet

Publication date 23 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-28404-4_15

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Adding nesting structure to words
• Automata, Languages and Programming
• Deterministic finite automata with recursive calls and DPDAs
• scientific article; zbMATH DE number 5595151 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 2087485 (Why is no real title available?)
• scientific article; zbMATH DE number 2242594 (Why is no real title available?)
• Learning regular sets from queries and counterexamples
• Marrying Words and Trees
• Model-checking structured context-free languages
• P-hardness of the emptiness problem for visibly pushdown languages
• Reachability analysis of pushdown automata: Application to model-checking
• Transition network grammars for natural language analysis
• Validating streaming JSON documents with learned VPAs
• Visibly pushdown languages

This page was built for publication: Visibly recursive automata

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