Clearing restarting automata
From MaRDI portal
Publication:3000289
DOI10.3233/FI-2010-334zbMATH Open1214.68190OpenAlexW1677011730MaRDI QIDQ3000289FDOQ3000289
Authors: Peter Černo, František Mráz
Publication date: 18 May 2011
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2010-334
Recommendations
Cited In (13)
- \(\Delta \)-clearing restarting automata and CFL
- A characterization of the context-free languages by stateless ordered restart-delete automata
- Lambda-confluence is undecidable for clearing restarting automata
- On the expressive power of stateless ordered restart-delete automata
- Lambda-confluence for context rewriting systems
- Two results on discontinuous input processing
- Decidability questions for insertion systems and related models
- Restarting automata with structured output and functional generative description
- Learning Analysis by Reduction from Positive Data
- Power of S-\(k\)R-RRWW-automata
- On restarting automata with window size one
- Restarting Tree Automata
- Regulated variants of limited context restarting automata
This page was built for publication: Clearing restarting automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000289)