An active learning algorithm for bidirectional deterministic finite automata

DOI10.1007/978-3-032-02602-6_8MaRDI QIDQ6861689zbMATH OpenFDO

Authors Simon Dieck, Sicco Verwer

Publication date 10 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-02602-6_8

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Efficient learning of multiple context-free languages with multidimensional substitutability from positive data
• Exact DFA Identification Using SAT Solvers
• Grammatical inference. Learning automata and grammars.
• Inference of finite automata using homing sequences
• Language identification in the limit
• Learning finite state models from recurrent neural networks
• Learning regular sets from queries and counterexamples
• Minimization and characterizations for biautomata
• On a hierarchy of \(5^{\prime}\rightarrow 3^{\prime}\) sensing Watson-Crick finite automata languages
• On biautomata
• On bidirectional deterministic finite automata
• On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN
• On linear languages recognized by deterministic biautomata
• Polynomial identification in the limit of substitutable context-free languages
• Testing Software Design Modeled by Finite-State Machines

Cited in

(1)

• Quasi-deterministic finite one-head and two-head automata

This page was built for publication: An active learning algorithm for bidirectional deterministic finite automata

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