Automata with Modulo Counters and Nondeterministic Counter Bounds

DOI10.1007/978-3-642-31606-7_33zbMath1297.68166OpenAlexW141970373MaRDI QIDQ2914726

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)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Complexity of multi-head finite automata: origins and directions
• On stateless multihead automata: hierarchies and the emptiness problem
• On pebble automata
• On partially blind multihead finite automata.
• ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA
• A Polynomial Time Match Test for Large Classes of Extended Regular Expressions
• ON STATELESS AUTOMATA AND P SYSTEMS
• On Stateless Multihead Finite Automata and Multihead Pushdown Automata
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Hierarchies and Characterizations of Stateless Multicounter Machines

This page was built for publication: Automata with Modulo Counters and Nondeterministic Counter Bounds