scientific article; zbMATH DE number 1979491

MaRDI QIDQ4425946zbMATH OpenFDO

Authors Zhe Dang, Oscar H. Ibarra, Zhi-Wei Sun

Publication date 14 September 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2518/25180103.htm

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Formal languages and automata (68Q45)

Recommendations

• On two-way nondeterministic finite automata with one reversal-bounded counter
• An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines
• scientific article; zbMATH DE number 3974295
• Remarks on two-way automata with weak-counters
• scientific article; zbMATH DE number 4058871
• ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES
• scientific article; zbMATH DE number 512842
• Reversal-bounded nondeterministic multicounter machines and complementation
• Decidability of reachability problems for classes of two counters automata

Cited in

(6)

• On two-way nondeterministic finite automata with one reversal-bounded counter
• On two-way FA with monotonic counters and quadratic Diophantine equations
• On composition and lookahead delegation of \(e\)-services modeled by automata
• Two-way counter machines and finite-state transducers†
• Safety verification for two-way finite automata with monotonic counters
• Reachability analysis of reversal-bounded automata on series-parallel graphs

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 Q4425946)