Correctness Preservation and Complexity of Simple RL-Automata

DOI10.1007/11812128_16MaRDI QIDQ5757212zbMATH OpenOpenAlexFDO

Authors Hartmut Messerschmidt, František Mráz, Friedrich Otto, Martin Plátek

Publication date 6 September 2007

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11812128_16

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Natural language processing (68T50)

Recommendations

• On the Gap-Complexity of Simple RL-Automata
• Learning Analysis by Reduction from Positive Data
• On minimalism of analysis by reduction by restarting automata
• Restarting automata with restricted utilization of auxiliary symbols
• 1-normal DRA for insertion languages

Cited in

(6)

• On minimalism of analysis by reduction by restarting automata
• Learning Analysis by Reduction from Positive Data
• On the Gap-Complexity of Simple RL-Automata
• On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
• One-Way Restarting Automata and Their Sensitivitys
• On determinism versus nondeterminism for restarting automata

This page was built for publication: Correctness Preservation and Complexity of Simple RL-Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757212)