Information flow in tabular interpretations for generalized push-down automata

Author： de la Clergerie E.V. Barthelemy F.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.199, Iss.1, 1998-06, pp. : 167-198

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Pushdown cellular automata

By Kutrib M.

Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. : 239-261

Elsevier

Access to resources Recommend Favorite

Properties of probabilistic pushdown automata

By Macarie I.I. Ogihara M.

Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. : 117-130

Elsevier

Access to resources Recommend Favorite

Analyzing probabilistic pushdown automata

By Brázdil Tomáš Esparza Javier Kiefer Stefan Kučera Antonín

Formal Methods in System Design, Vol. 43, Iss. 2, 2013-10 ,pp. : 124-163

Springer Publishing Company

Access to resources Recommend Favorite

Stack Cooperation in Multistack Pushdown Automata

By Dassow J. Mitrana V.

Journal of Computer and System Sciences, Vol. 58, Iss. 3, 1999-06 ,pp. : 611-621

Academic Press

Access to resources Recommend Favorite

Pushdown automata with bounded nondeterminism and bounded ambiguity

By Herzog C.

Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. : 141-157

Elsevier

Access to resources Recommend Favorite