A property of real-time trellis automata

DOI10.1016/0166-218X(86)90025-9zbMATH Open0597.68048OpenAlexW2019846069MaRDI QIDQ1079372FDOQ1079372

Authors: Sheng Yu 

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(86)90025-9

Recommendations

• scientific article; zbMATH DE number 4047120
• scientific article; zbMATH DE number 17546
• scientific article; zbMATH DE number 769370
• Some computational limits of trellis automata
• Systolic trellis automata: Stability, decidability and complexity

zbMATH Keywords

real-time acceptance

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80)

Cites Work

• Systolic trellis automatata †
• Characterizations and computational complexity of systolic trellis automata
• On real-time cellular automata and trellis automata
• Systolic trellis automatat†

Cited In (10)

• Some computational limits of trellis automata
• Expressive power of \(\text{LL}(k)\) Boolean grammars
• Title not available (Why is that?)
• Conjunctive and Boolean grammars: the true general case of the context-free grammars
• On hardest languages for one-dimensional cellular automata
• \(\mathrm{GF}(2)\)-operations on basic families of formal languages
• Title not available (Why is that?)
• On hardest languages for one-dimensional cellular automata
• Linear grammars with one-sided contexts and their automaton representation
• Linear-space recognition for grammars with contexts

This page was built for publication: A property of real-time trellis automata

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