On bounded languages and reversal-bounded automata
type: Item
instance of: scholarly article
title: On bounded languages and reversal-bounded automata
zbMATH Open document ID: 1333.68168
author: Oscar H. Ibarra
author: B. Ravikumar
published in: Information and Computation
publication date: 2015-12-28T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6524288
zbMATH Keywords: context-free language (CFL)
zbMATH Keywords: nondeterministic pushdown automaton (NPDA)
zbMATH Keywords: reversal-bounded
zbMATH Keywords: semilinear set
zbMATH Keywords: stratified linear set
MaRDI profile type: Publication
full work available at URL: j.ic.2015.11.007
OpenAlex ID: W2186218795
cites work: Q4430303
cites work: Q3862379
cites work: Q5576254
cites work: Linearity is polynomially decidable for realtime pushdown store automata
cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems
cites work: CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES
cites work: Finite turns and the regular closure of linear context-free languages
cites work: A characterization of semilinear sets
cites work: Descriptional Complexity of Bounded Context-Free Languages
cites work: On Context-Free Languages
DOI: 10.1016/J.IC.2015.11.007
description: scientific article; zbMATH DE number 6524288