Time varying pushdown automata

DOI10.1080/00207168808803646MaRDI QIDQ3806847zbMATH OpenOpenAlexFDO

Authors

Publication date 1988

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168808803646

zbMATH Keywords

context-free languagesGreibach normal formrecursively enumerable setsterminal weighted grammarstime varying pushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Time varying finite automata
• scientific article; zbMATH DE number 739127
• Variations on pushdown machines (Detailed Abstract)
• Pushdown cellular automata
• Alternating Pushdown and Stack Automata

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• Terminal weighted grammars and picture description
• Time varying finite automata

Cited in

(7)

• SE-SYSTEMS, TIMING MECHANISMS, AND TIME-VARYING CODES
• Time varying finite automata
• Some results on time-varying and relativised cellular automata^*
• scientific article; zbMATH DE number 739127 (Why is no real title available?)
• Timed Pushdown Automata Revisited
• Quasi-rocking real-time pushdown automata
• Automata with a time-variant structure and supply-demand theorems

This page was built for publication: Time varying pushdown automata

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