On the Gap-Complexity of Simple RL-Automata

DOI10.1007/11779148_9MaRDI QIDQ3617048zbMATH OpenOpenAlexFDO

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

Publication date 26 March 2009

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

Full work available at URL http://nbn-resolving.org/urn:nbn:de:hebis:34-2006053112600

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(4)

• On minimalism of analysis by reduction by restarting automata
• Learning Analysis by Reduction from Positive Data
• On restarting automata with window size one
• Correctness Preservation and Complexity of Simple RL-Automata

This page was built for publication: On the Gap-Complexity of Simple RL-Automata

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