scientific article; zbMATH DE number 3932374

MaRDI QIDQ3704882zbMATH OpenFDO

Authors A. I. Auzin'sh

Publication date 1984

zbMATH Keywords

deterministic automataemptiness problemequivalence problemrecursive automatarecursive programs

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 408816
• On the construction of complete systems of equivalent transformations of program schemes
• Sampling automata and programs
• Constructing simply recursive programs from a finite set of good examples
• A provably correct sampler for probabilistic programs
• scientific article; zbMATH DE number 4020482
• scientific article; zbMATH DE number 3849623
• Completeness of combinations of constructor systems
• Completeness of combinations of constructor systems
• scientific article; zbMATH DE number 4124987

Cited in

(2)

• On complete sets of samples for generalized regular expressions
• Automatic construction of test sets: theoretical approach

This page was built for publication:

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