On visibly pushdown trace languages

DOI10.1007/978-3-662-46078-8_32MaRDI QIDQ5175125zbMATH OpenOpenAlexFDO

Authors Friedrich Otto

Publication date 20 February 2015

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

Full work available at URL https://doi.org/10.1007/978-3-662-46078-8_32

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• An Automata-Theoretical Characterization of Context-Free Trace Languages
• CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
• Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
• CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
• scientific article; zbMATH DE number 17820

Cited in

(4)

• Realizability of concurrent recursive programs
• Streaming Property Testing of Visibly Pushdown Languages *
• scientific article; zbMATH DE number 1916672 (Why is no real title available?)
• A survey on automata with translucent letters

This page was built for publication: On visibly pushdown trace languages

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