Visibly pushdown automata and transducers with counters

DOI10.3233/FI-2016-1436MaRDI QIDQ4589236zbMATH OpenFDO

Authors Oscar H. Ibarra

Publication date 9 November 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

reversal-bounded countersdecidablepushdown automatonpushdown transducervisibly pushdown automatonundecidableambiguousvisibly pushdown transducerfinite-valued

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Visibly Pushdown Transducers
• Grammatical characterizations of NPDAs and VPDAs with counters
• 2-Visibly Pushdown Automata
• Visibly pushdown transducers
• Regularity Problems for Visibly Pushdown Languages

Cited in

(14)

• Input-driven multi-counter automata
• Verifying quantitative temporal properties of procedural programs
• Input-Position-Restricted Models of Language Acceptors
• Pushdown automata with reversal-bounded counters
• Trimming visibly pushdown automata
• On the Expressive Power of 2-Stack Visibly Pushdown Automata
• On Model Checking for Visibly Pushdown Automata
• Grammatical characterizations of NPDAs and VPDAs with counters
• On store languages of language acceptors
• On the complexity of membership and counting in height-deterministic pushdown automata
• 2-Visibly Pushdown Automata
• Event-Clock Visibly Pushdown Automata
• Two-way Parikh automata with a visibly pushdown stack
• Visibly pushdown automata with multiplicities: finiteness and \(K\)-boundedness

This page was built for publication: Visibly pushdown automata and transducers with counters

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