Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata

DOI10.1007/S00236-012-0175-XMaRDI QIDQ2391861zbMATH OpenOpenAlexFDO

Authors Benedek Nagy, Friedrich Otto

Publication date 5 August 2013

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-012-0175-x

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
• CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
• Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
• On CD-systems of stateless deterministic R-automata with window size one
• Globally deterministic CD-systems of stateless R-automata with window size 1

Cites work

• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3684913 (Why is no real title available?)
• scientific article; zbMATH DE number 3786151 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 1490007 (Why is no real title available?)
• scientific article; zbMATH DE number 745858 (Why is no real title available?)
• scientific article; zbMATH DE number 3307576 (Why is no real title available?)
• An Automata-Theoretical Characterization of Context-Free Trace Languages
• CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
• CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
• COOPERATING DISTRIBUTED SYSTEMS OF RESTARTING AUTOMATA
• Church-Rosser Thue systems and formal languages
• Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages
• Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
• Developments in Language Theory
• Globally deterministic CD-systems of stateless \(R(1)\)-automata
• Linear indexed languages
• Membership for growing context-sensitive grammars is polynomial
• Membership problems for regular and context-free trace languages
• Models of pushdown automata with reset
• ON DETERMINISTIC CD-SYSTEMS OF RESTARTING AUTOMATA
• On CD-systems of stateless deterministic R-automata with window size one
• On stateless two-pushdown automata and restarting automata
• Restarting automata
• Some decision problems about controlled rewriting systems
• Theory of traces

Cited in

(7)

• CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
• On visibly pushdown trace languages
• scientific article; zbMATH DE number 6606350 (Why is no real title available?)
• A survey on automata with translucent letters
• Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
• CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
• On properties of languages accepted by deterministic pushdown automata with translucent input letters

This page was built for publication: Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata

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