Fairness for pushdown automata.

zbMATH Open1225.68089MaRDI QIDQ642871FDOQ642871

Authors Douadi Mihoubi

Publication date 27 October 2011

Published in Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.bbms/1313604458

zbMATH Keywords

automates finis et à picéquitésgrammaire linéaire

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Sets of Infinite Words Recognized by Deterministic One-Turn Pushdown Automata
• scientific article; zbMATH DE number 4050966
• scientific article; zbMATH DE number 4087032
• scientific article; zbMATH DE number 4096758
• scientific article; zbMATH DE number 4045202

Cited in

(2)

• scientific article; zbMATH DE number 1836386 (Why is no real title available?)
• Automatic discovery of fair paths in infinite-state transition systems

This page was built for publication: Fairness for pushdown automata.

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