Titlebook: Automata, Languages and Programming; 10th Colloquium Barc Josep Diaz Conference proceedings 1983 Springer-Verlag Berlin Heidelberg 1983 Mon

ULCER

Algebraic specifications with generating constraints, be generated by the operations. In the initial algebraic approach as well as in the loose case with initial restrictions or data constraints this principle is satisfied because of initiality resp. free construction. Actually initiality makes sure that the data under consideration are not only gener

Eeg332

Initial index: A new complexity function for languages,ting the minimal number of states of automata recognizing approximations of a language..The family of polynomial initial languages is defined, and it is proved that it is an intersection-closed A.F.L. The relations between this family and on-line multicounter Turing-machines, Petri-net languages and

CROAK