{"id":{"repo_id":"debrecen","oai_identifier":"oai:dea.lib.unideb.hu:2437/413377"},"canonical_url":"https://search.dev.ndltd.org/etd/debrecen/oai:dea.lib.unideb.hu:2437/413377","repository":{"repo_id":"debrecen","name":"University of Debrecen","base_url":"https://dea.lib.unideb.hu/server/oai/request"},"display":{"title":"Exploring Computational Models: Analysis, Extensions, and Novel Approaches in Automata Theory","abstract":"This thesis investigates the structure, limitations, and extensions of classical computational models, including finite automata, pushdown automata, and Turing machines. Motivated by the trade-off between expressive power and structural simplicity, it introduces a novel model called Counter-Based Finite Automata (CBFA). The proposed model extends deterministic finite automata by incorporating counters that accumulate quantitative information during computation while preserving finite-state control. Several variants of CBFA are formally defined and analyzed, including state-based, input-based, and transition-based models. The thesis establishes key theoretical results, such as linear-time membership and the ability to recognize certain non-context-free languages, while also identifying limitations of the model. Finally, it situates CBFA within the broader computational hierarchy and outlines future research directions, including extensions toward counter-based pushdown automata.","abstract_html":"This thesis investigates the structure, limitations, and extensions of classical computational models, including finite automata, pushdown automata, and Turing machines. Motivated by the trade-off between expressive power and structural simplicity, it introduces a novel model called Counter-Based Finite Automata (CBFA). The proposed model extends deterministic finite automata by incorporating counters that accumulate quantitative information during computation while preserving finite-state control. Several variants of CBFA are formally defined and analyzed, including state-based, input-based, and transition-based models. The thesis establishes key theoretical results, such as linear-time membership and the ability to recognize certain non-context-free languages, while also identifying limitations of the model. Finally, it situates CBFA within the broader computational hierarchy and outlines future research directions, including extensions toward counter-based pushdown automata.","abstract_has_math":false,"creators":["Sayor, S M Sadman Sakib"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"DE--Informatikai Kar","school":null,"contributors":[],"advisors":["Horváth, Géza"],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-07-27T19:13:30Z","subjects":["Automata Theory","Computational Models","Counter-Based Finite Automata (CBFA)"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2437/413377","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Horváth, Géza"]},{"key":"dc:contributor.department","label":"Department","values":["DE--Informatikai Kar"]},{"key":"dc:creator","label":"Author","values":["Sayor, S M Sadman Sakib"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2026-07-14T19:46:54Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2026-07-14T19:46:54Z"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Automata Theory","Computational Models","Counter-Based Finite Automata (CBFA)"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/2437/413377"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This thesis investigates the structure, limitations, and extensions of classical computational models, including finite automata, pushdown automata, and Turing machines. Motivated by the trade-off between expressive power and structural simplicity, it introduces a novel model called Counter-Based Finite Automata (CBFA). The proposed model extends deterministic finite automata by incorporating counters that accumulate quantitative information during computation while preserving finite-state control. Several variants of CBFA are formally defined and analyzed, including state-based, input-based, and transition-based models. The thesis establishes key theoretical results, such as linear-time membership and the ability to recognize certain non-context-free languages, while also identifying limitations of the model. Finally, it situates CBFA within the broader computational hierarchy and outlines future research directions, including extensions toward counter-based pushdown automata."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["BSc/BA"]},{"key":"dc:title","label":"Title","values":["Exploring Computational Models: Analysis, Extensions, and Novel Approaches in Automata Theory"]}]}],"canonical_facts":{"dc:contributor.advisor":["Horváth, Géza"],"dc:contributor.department":["DE--Informatikai Kar"],"dc:creator":["Sayor, S M Sadman Sakib"],"dc:date.accessioned":["2026-07-14T19:46:54Z"],"dc:date.available":["2026-07-14T19:46:54Z"],"dc:description.abstract":["This thesis investigates the structure, limitations, and extensions of classical computational models, including finite automata, pushdown automata, and Turing machines. Motivated by the trade-off between expressive power and structural simplicity, it introduces a novel model called Counter-Based Finite Automata (CBFA). The proposed model extends deterministic finite automata by incorporating counters that accumulate quantitative information during computation while preserving finite-state control. Several variants of CBFA are formally defined and analyzed, including state-based, input-based, and transition-based models. The thesis establishes key theoretical results, such as linear-time membership and the ability to recognize certain non-context-free languages, while also identifying limitations of the model. Finally, it situates CBFA within the broader computational hierarchy and outlines future research directions, including extensions toward counter-based pushdown automata."],"dc:description.degree":["BSc/BA"],"dc:identifier.uri":["https://hdl.handle.net/2437/413377"],"dc:language.iso":["en"],"dc:subject":["Automata Theory","Computational Models","Counter-Based Finite Automata (CBFA)"],"dc:title":["Exploring Computational Models: Analysis, Extensions, and Novel Approaches in Automata Theory"]},"updated_at":"2026-07-27T19:13:30Z"}