On equal matrix languages

DOI10.1016/S0019-9958(69)90050-3MaRDI QIDQ5556439zbMATH OpenFDO

Authors Rani Siromoney

Publication date 1969

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(69)90050-3

zbMATH Keywords

languages, automata, networks

Cited in

(29)

• Fair derivations in E0L systems
• Shuffle on trajectories: Syntactic constraints
• Tree transducers, L systems, and two-way machines
• Independance forte de certaines opérations
• On the generative capacity of compound string and array grammars
• Learning semilinear sets from examples and via queries
• Marker automata
• Commutative grammars
• One way finite visit automata
• On two-way sequential transductions of full semi-AFL's
• On the family of finite index matrix languages
• Controlled pushdown automata
• On the teaching complexity of linear sets
• Simple picture processing based on finite automata and regular grammars
• Theory of formal grammars
• Even linear simple matrix languages: formal language properties and grammatical inference.
• A CKY parser for picture grammars
• Finite-turn checking automata
• AFL with the semilinear property
• Parallel generation of infinite images
• Single-tape reset machines
• Compelled operations and operations of degreeP
• Array automata and operations on array languages
• Characterizations of regular and context-free matrices
• On languages with a certain prefix property
• Parallel/sequential rectangular arrays with tables
• scientific article; zbMATH DE number 3604381 (Why is no real title available?)
• A Characterization of Semilinear Sets
• Syntactic operators on full semiAFLs

This page was built for publication: On equal matrix languages

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