Language equivalence of deterministic real-time one-counter automata is NL-complete
DP lower bounds for equivalence-checking and model-checking of one-counter automata
Trace Inclusion for One-Counter Nets Revisited
Hierarchy of various models of counter automata | Download Scientific Diagram
PDF) On History-Deterministic One-Counter Nets
Equivalence of Deterministic One-Counter Automata is NL-complete
![PDF] Equivalence of Deterministic One-Counter Automata is NL-complete | Semantic Scholar](https://d3i71xaburhd42.cloudfront.net/95b234a1ffe044c3adfa635a26dddbe782f3db15/7-Figure2-1.png "PDF] Equivalence of Deterministic One-Counter Automata is NL-complete | Semantic Scholar")
PDF] Equivalence of Deterministic One-Counter Automata is NL-complete | Semantic Scholar
LNCS 3328 - Real-Counter Automata and Their Decision Problems(Extended Abstract)
NON-RECURSIVE TRADE-OFFS FOR TWO-WAY MACHINES 1. Introduction The origins of descriptional complexity of formal machines can be
PDF) Simulation Problems for One-Counter Machines
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds
Counter automaton - Wikipedia
Multistack & Counter Machines - Automata Theory Questions and Answers - Sanfoundry
On Büchi One-Counter Automata
![PDF] Equivalence of Deterministic One-Counter Automata is NL-complete | Semantic Scholar](https://d3i71xaburhd42.cloudfront.net/95b234a1ffe044c3adfa635a26dddbe782f3db15/5-Figure1-1.png "PDF] Equivalence of Deterministic One-Counter Automata is NL-complete | Semantic Scholar")
PDF] Equivalence of Deterministic One-Counter Automata is NL-complete | Semantic Scholar
Counter automaton - Wikipedia
On the equivalence of two-way pushdown automata and counter machines over bounded languages | SpringerLink
Introduction to Theoretical Computer Science: Equivalent models of computation
context free - Construction of a counter automaton for the complement of the palindromes - Computer Science Stack Exchange
Equivalence of Two Finite Automata - YouTube
Infrared LED fish counting machine - Pescavision 10 - Faivre Sarl - 1-channel / for aquaculture
Learning Automata with Hankel Matrices - Borja Balle, Amazon Research Cambridge - YouTube
Tool Demonstration of the FLATA Counter Automata Toolset∗
Example: 2-bit binary counter automaton (a marker; b counter) | Download Scientific Diagram
Unary Languages Recognized by Two-Way One-Counter Automata | SpringerLink
Characterizations of Bounded Semilinear Languages by One-way and Two-way Deterministic Machines Oscar H. Ibarra 1 and Shinnosuke Seki 2 1. Department of. - ppt download
