Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
A Fragment of ML Decidable by...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
A Fragment of ML Decidable by Visibly Pushdown Automata
Bibliographic Details
Main Authors:
Hopkins, D
,
Murawski, A
,
Ong, C
Format:
Conference item
Published:
2011
Holdings
Description
Similar Items
Staff View
Description
Summary:
Similar Items
ML, visibly pushdown class memory automata, and extended branching vector addition systems with states
by: Cotton-Barratt, C, et al.
Published: (2019)
Collapsible pushdown automata and recursion schemes
by: Hague, M, et al.
Published: (2017)
Reachability in pushdown register automata
by: Murawski, A, et al.
Published: (2017)
Collapsible pushdown automata and recursion schemes
by: Hague, M, et al.
Published: (2008)
Collapsible Pushdown Automata and Recursion Schemes
by: Murawski, C, et al.
Published: (2008)