Quasi-rocking real-time pushdown automata

DOI10.1016/J.TCS.2011.08.029zbMATH Open1227.68060OpenAlexW2059417750MaRDI QIDQ650904FDOQ650904

Changwook Kim

Publication date: 7 December 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.08.029

zbMATH Keywords

normal formsreal-timepushdown automatalanguage hierarchydecision propertiesgrammatical characterizationsquasi-rocking

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Deterministic context free languages
• Quasi-realtime languages
• Finite-Turn Pushdown Automata
• \(L(A)=L(B)\)? decidability results from complete formal systems
• Turn-bounded grammars and their relation to ultralinear languages
• Apex graph grammars and attribute grammars
• A hierarchy of eNCE families of graph languages
• Node replacement graph languages squeezed with chains, trees, and forests
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
• Efficient recognition algorithms for boundary and linear eNCE graph languages
• Boundary graph grammars with dynamic edge relabeling
• Context-free graph languages of bounded degree are generated by apex graph grammars
• An elementary proof of double Greibach normal form
• Double Greibach operator grammars

Cited In (2)

• Title not available (Why is that?)
• Synchronizing deterministic push-down automata can be really hard

This page was built for publication: Quasi-rocking real-time pushdown automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650904)