@inproceedings{10.1007/3-540-13331-3_38,
Abstract = {Smullyan [61] introduced the class R of rudimentary relations as the smallest class which contains the concatenation relation and which is closed under the boolean operations, explicit transformations and linearly bounded quantification. RUD, the class of rudimentary languages, consists of the sequential encodings of rudimentary relations. Wrathall [75] has shown that RUD can be described as the union LH of a linear time analogue of the polynomial time hierarchy of PH of Meyer,Stockmeyer [72].},
Address = {Berlin, Heidelberg},
Author = {Volger, Hugo},
BookTitle = {Logic and Machines: Decision Problems and Complexity},
Editor = {B{\"o}rger, E. and Hasenjaeger, G. and R{\"o}dding, D.},
File = {Rudimentary relations and Turing machines with linear alternation - Volger1984\_Chapter\_RudimentaryRelationsAndTuringM.pdf},
ISBN = {978-3-540-38856-2},
Pages = {131--136},
Publisher = {Springer Berlin Heidelberg},
Title = {Rudimentary relations and Turing machines with linear alternation},
Year = {1984},
date-added = {2022-01-06 08:36:54 +0100},
date-modified = {2022-01-06 08:36:54 +0100},
doi = {10.1007/3-540-13331-3_38}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A