Quasi-rocking real-time pushdown automata
type: Item
instance of: scholarly article
title: Quasi-rocking real-time pushdown automata
zbMATH Open document ID: 1227.68060
author: Changwook Kim
published in: Theoretical Computer Science
publication date: 2011-12-07T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 5986999
zbMATH Keywords: pushdown automata
zbMATH Keywords: quasi-rocking
zbMATH Keywords: real-time
zbMATH Keywords: normal forms
zbMATH Keywords: grammatical characterizations
zbMATH Keywords: language hierarchy
zbMATH Keywords: decision properties
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.08.029
OpenAlex ID: W2059417750
cites work: Quasi-realtime languages
cites work: An elementary proof of double Greibach normal form
cites work: Context-free graph languages of bounded degree are generated by apex graph grammars
cites work: Apex graph grammars and attribute grammars
cites work: Boundary graph grammars with dynamic edge relabeling
cites work: Deterministic context free languages
cites work: Finite-Turn Pushdown Automata
cites work: Q4198075
cites work: Q5592246
cites work: A hierarchy of eNCE families of graph languages
cites work: Efficient recognition algorithms for boundary and linear eNCE graph languages
cites work: Double Greibach operator grammars
cites work: Node replacement graph languages squeezed with chains, trees, and forests
cites work: Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
cites work: Q3741057
cites work: Q5678435
cites work: \(L(A)=L(B)\)? decidability results from complete formal systems
cites work: Turn-bounded grammars and their relation to ultralinear languages
DOI: 10.1016/J.TCS.2011.08.029
description: scientific article; zbMATH DE number 5986999