Characterizations of regular and context-free matrices

DOI10.1080/00207167408803090MaRDI QIDQ4057628zbMATH OpenOpenAlexFDO

Authors Kamala Krithivasan, Rani Siromoney

Publication date 1974

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A characterization of context-free languages
• Absolutely parallel grammars and two-way finite-state transducers
• Array automata and operations on array languages
• Full AFLs and nested iterated substitution
• scientific article; zbMATH DE number 3471633 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• On equal matrix languages
• Simple matrix languages

Cited in

(8)

• A note on an extension of matrix grammars generating two-dimensional languages
• Simple picture processing based on finite automata and regular grammars
• Parallel contextual array insertion deletion P systems and tabled matrix grammars
• ON ARRAY GRAMMARS AND LANGUAGES
• Parallel/sequential rectangular arrays with tables
• Variations of the matrix models
• Boustrophedon pushdown automata for two-dimensional picture languages
• Pure 2D picture grammars and languages

This page was built for publication: Characterizations of regular and context-free matrices

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