On equal matrix languages
From MaRDI portal
Publication:5556439
DOI10.1016/S0019-9958(69)90050-3zbMath0169.31402MaRDI QIDQ5556439
Publication date: 1969
Published in: Information and Control (Search for Journal in Brave)
Related Items (29)
Single-tape reset machines ⋮ A CKY parser for picture grammars ⋮ Parallel generation of infinite images ⋮ Unnamed Item ⋮ Shuffle on trajectories: Syntactic constraints ⋮ Tree transducers, L systems, and two-way machines ⋮ Controlled pushdown automata ⋮ A Characterization of Semilinear Sets ⋮ Independance forte de certaines opérations ⋮ On the teaching complexity of linear sets ⋮ Array automata and operations on array languages ⋮ Characterizations of regular and context-free matrices ⋮ On the generative capacity of compound string and array grammars ⋮ Simple picture processing based on finite automata and regular grammars ⋮ Learning semilinear sets from examples and via queries ⋮ On languages with a certain prefix property ⋮ Parallel/sequential rectangular arrays with tables ⋮ Marker automata ⋮ Commutative grammars ⋮ One way finite visit automata ⋮ On two-way sequential transductions of full semi-AFL's ⋮ Compelled operations and operations of degreeP ⋮ On the family of finite index matrix languages ⋮ Syntactic operators on full semiAFLs ⋮ Finite-turn checking automata ⋮ AFL with the semilinear property ⋮ Theory of formal grammars ⋮ Even linear simple matrix languages: formal language properties and grammatical inference. ⋮ Fair derivations in E0L systems
This page was built for publication: On equal matrix languages
