Automata with modulo counters and nondeterministic counter bounds

DOI10.1007/978-3-642-31606-7_33MaRDI QIDQ2914726zbMATH OpenOpenAlexFDO

Authors Daniel Reidenbach, Markus L. Schmid

Publication date 20 September 2012

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://dspace.lboro.ac.uk/2134/10358

zbMATH Keywords

multi-head automatarestricted nondeterminismstateless automatacounter automatamodulo counters

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Automata with modulo counters and nondeterministic counter bounds
• On families of full trios containing counter machine languages
• On two-way nondeterministic finite automata with one reversal-bounded counter
• Bounded counter languages
• Automata with Reversal-Bounded Counters: A Survey

Cites work

• scientific article; zbMATH DE number 3690693 (Why is no real title available?)
• A polynomial time match test for large classes of extended regular expressions
• Complexity of multi-head finite automata: origins and directions
• Hierarchies and Characterizations of Stateless Multicounter Machines
• ON STATELESS AUTOMATA AND P SYSTEMS
• On Stateless Multihead Finite Automata and Multihead Pushdown Automata
• On partially blind multihead finite automata.
• On pebble automata
• On stateless multihead automata: hierarchies and the emptiness problem
• On stateless two-pushdown automata and restarting automata
• Reversal-Bounded Multicounter Machines and Their Decision Problems

Cited in

(1)

• Automata with modulo counters and nondeterministic counter bounds

This page was built for publication: Automata with modulo counters and nondeterministic counter bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914726)