Generalizations of checking stack automata: characterizations and hierarchies
type: Item
instance of: scholarly article
title: Generalizations of checking stack automata: characterizations and hierarchies
DOI: 10.1007/978-3-319-98654-8_34
author: Oscar H. Ibarra
author: Ian McQuillan
publication date: 2018-11-22T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6983396
zbMATH Keywords: checking stack automata
zbMATH Keywords: multi-head finite automata
zbMATH Keywords: characterizations
zbMATH Keywords: space-bounded Turing machines
zbMATH Keywords: hierarchies
MaRDI profile type: Publication
full work available at URL: 978-3-319-98654-8 34
OpenAlex ID: W2886308858
Recommended article: Generalizations of Checking Stack Automata: Characterizations and Hierarchies
Recommended article: Variations of checking stack automata: obtaining unexpected decidability properties
Recommended article: The power of two-way deterministic checking stack automata
Recommended article: Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking
Recommended article: Streett Automata Model Checking of Higher-Order Recursion Schemes
Recommended article: Automata-Theoretic Model Checking Revisited
Recommended article: Q4673421
Recommended article: A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
description: scientific article; zbMATH DE number 6983396