Characterizations of regular and context-free matrices

DOI10.1080/00207167408803090zbMath0302.68089OpenAlexW2000804470MaRDI QIDQ4057628

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)

Related Items (7)

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

Cites Work

• Unnamed Item
• Unnamed Item
• A characterization of context-free languages
• Absolutely parallel grammars and two-way finite-state transducers
• Array automata and operations on array languages
• On equal matrix languages
• Full AFLs and nested iterated substitution
• Simple matrix languages

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