On bidirectional deterministic finite automata

DOI10.1007/978-3-031-71112-1_8MaRDI QIDQ6666791zbMATH OpenFDO

Authors Simon Dieck, Sicco Verwer

Publication date 20 January 2025

Full work available at URL https://doi.org/10.1007/978-3-031-71112-1_8

zbMATH Keywords

context-free languagesDFAlinear languagesregular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A new approach for active automata learning based on apartness
• A theory of timed automata
• Grammatical inference. Learning automata and grammars.
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• Learning finite state models from recurrent neural networks
• Learning regular sets from queries and counterexamples
• Minimization and characterizations for biautomata
• Nested weighted automata
• On a hierarchy of \(5^{\prime}\rightarrow 3^{\prime}\) sensing Watson-Crick finite automata languages
• On biautomata
• On deterministic 1-limited 5' 3' sensing Watson-Crick finite-state transducers
• On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN
• On linear languages recognized by deterministic biautomata
• On the translation of languages from left to right
• Probabilistic automata

Cited in

(2)

• Quasi-deterministic finite one-head and two-head automata
• An active learning algorithm for bidirectional deterministic finite automata

This page was built for publication: On bidirectional deterministic finite automata

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