scientific article; zbMATH DE number 1836417

MaRDI QIDQ4782102zbMATH OpenFDO

Authors Martin Kutrib

Publication date 27 November 2002

zbMATH Keywords

context-free languagesautomata arrays

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Fast parallel language recognition by cellular automata
• scientific article; zbMATH DE number 6888
• Cellular automata -- a computational point of view
• scientific article; zbMATH DE number 1254096
• C-tree systolic automata

Cited in

(6)

• Real-time reversible iterative arrays
• Fast reversible language recognition using cellular automata
• On two-way communication in cellular automata with a fixed number of cells
• Families of automata characterizing context-sensitive languages
• Simulating finite automata with context-free grammars.
• Finite turns and the regular closure of linear context-free languages

This page was built for publication:

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