Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Guney Gonenc

dblp:126/7907 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1973
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%
Theoretical computer science
1 paper
Automata and formal languages · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test › sequential circuit testing
checking experiments
0.011970
A Method for the Design of Fault Detection Experiments · IEEE Trans. Computers 1970
Electronic design automation › hardware verification and test
fault-detection experiment
0.011970
A Method for the Design of Fault Detection Experiments · IEEE Trans. Computers 1970
Electronic design automation
hardware verification and test
0.011970
A Method for the Design of Fault Detection Experiments · IEEE Trans. Computers 1970

Methods — techniques the papers use, named apart from their topics

transition checking · 0.0distinguishing sequences · 0.0distinguishing sequence · 0.0
YearPublicationVenuePosition
1973 Unique Decipherability of Codes with Constraints with Application to Syllabification of Turkish Words
Guney Gonenc
COLING1
1970 A Method for the Design of Fault Detection Experiments
abstract
A methodical procedure for organization of fault detection experiments for synchronous sequential machines possessing distinguishing sequences (DS) is given. The organization is based on the transition checking approach. The checking experiment is considered in three concatenative parts: 1) the initial sequence which brings the machine under test into a specific state, 2) the α-sequence to recognize all the states and to establish the information about the next states under the input DS, and 3) the β-sequence to check all the individual transitions in the state table.
Guney Gonenc
IEEE Trans. Computers1