Δ-Clearing Restarting Automata and $\makebox{\sf CFL} $

DOI10.1007/978-3-642-22321-1_14zbMath1221.68121OpenAlexW116340205MaRDI QIDQ5199961

Peter Černo, František Mráz

Publication date: 29 July 2011

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22321-1_14

zbMATH Keywords

formal languagescontext-free languagesanalysis by reduction\(\Delta \)-clearing restarting automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Regulated variants of limited context restarting automata ⋮ On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages ⋮ On the expressive power of stateless ordered restart-delete automata ⋮ Decidability Questions for Insertion Systems and Related Models

This page was built for publication: Δ-Clearing Restarting Automata and $\makebox{\sf CFL} $