Automata with modulo counters and nondeterministic counter bounds

DOI10.1007/978-3-642-31606-7_33zbMATH Open1297.68166OpenAlexW141970373MaRDI QIDQ2914726FDOQ2914726

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

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

zbMATH Keywords

multi-head automatarestricted nondeterminismstateless automatacounter automatamodulo counters

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

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

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)