Restarting automata
From MaRDI portal
Publication:5055900
DOI10.1007/3-540-60249-6_60OpenAlexW2914385399MaRDI QIDQ5055900
František Mráz, Jörg Vogel, Martin Plátek, Petr Jančar
Publication date: 9 December 2022
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60249-6_60
Related Items (30)
Regulated variants of limited context restarting automata ⋮ Weighted restarting automata and pushdown relations ⋮ Sorted dependency insertion grammars ⋮ Restarting automata ⋮ On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata ⋮ Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata ⋮ Restarting automata with restricted utilization of auxiliary symbols ⋮ Marcus \(t\)-contextual grammars and cut hierarchies and monotonicity for restarting automata ⋮ Degrees of non-monotonicity for restarting automata ⋮ Two-way deterministic automata with jumping mode ⋮ Weighted Restarting Automata and Pushdown Relations ⋮ A hierarchy of jumping restarting automata ⋮ Non-returning deterministic and nondeterministic finite automata with translucent letters ⋮ A survey on automata with translucent letters ⋮ Sweep complexity revisited ⋮ Reversibility of computations in graph-walking automata ⋮ Unnamed Item ⋮ Restarting transducers, regular languages, and rational relations ⋮ Succinct description of regular languages by weak restarting automata ⋮ On determinism versus nondeterminism for restarting automata ⋮ A Complete Taxonomy of Restarting Automata without Auxiliary Symbols* ⋮ Universal insertion grammars of size two ⋮ On deterministic ordered restart-delete automata ⋮ A Hierarchy of Transducing Observer Systems ⋮ Weighted restarting automata ⋮ Deterministic ordered restarting automata for picture languages ⋮ Reversible Ordered Restarting Automata ⋮ Descriptional complexity of regular languages ⋮ Context-free languages can be accepted with absolutely no space overhead ⋮ Lambda-confluence for context rewriting systems
Cites Work
This page was built for publication: Restarting automata
