Efficient learning of real time one-counter automata

DOI10.1007/3-540-60454-5_26zbMath1527.68104OpenAlexW1514160155MaRDI QIDQ6061883

Robert S. Roos, Amr F. Fahmy

Publication date: 8 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://nrs.harvard.edu/urn-3:HUL.InstRepos:24829137

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Learning regular sets from queries and counterexamples
• Deterministic one-counter automata
• Synthesis of real time acceptors
• An O(n log n) algorithm for finding all repetitions in a string

This page was built for publication: Efficient learning of real time one-counter automata