INPUT/OUTPUT CODINGS AND TRANSITION FUNCTIONS IN EFFECTIVE SYSTEMS
From MaRDI portal
Publication:4162665
DOI10.1080/03081077808960684zbMath0383.68046OpenAlexW2102619655MaRDI QIDQ4162665
Bernhard Roider, Bruno Buchberger
Publication date: 1978
Published in: International Journal of General Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081077808960684
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Recursive functions and relations, subrecursive hierarchies (03D20) Axiomatic systems theory (93A05)
Cites Work
- Unnamed Item
- Combinatorial systems. I: Cylindrical problems
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Theory of Formal Systems. (AM-47)
- Creative Functions
- AUTOMATA AND DIGITAL COMPUTERS
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Machine Configuration and Word Problems of Given Degree of Unsolvability
This page was built for publication: INPUT/OUTPUT CODINGS AND TRANSITION FUNCTIONS IN EFFECTIVE SYSTEMS
