Trimming visibly pushdown automata

DOI10.1016/j.tcs.2015.01.018zbMath1312.68116OpenAlexW2002121536MaRDI QIDQ2344743

Pierre-Alain Reynier, Mathieu Caralp, Jean-Marc Talbot

Publication date: 18 May 2015

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.01.018

zbMATH Keywords

trimmingvisibly pushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On finite semigroups of matrices
• Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
• On the Determinization of Weighted Finite Automata
• Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness
• Adding nesting structure to words
• Visibly Pushdown Transducers
• Visibly pushdown languages
• Properties of Visibly Pushdown Transducers
• Automata, Languages and Programming

This page was built for publication: Trimming visibly pushdown automata