Sampling a two-way finite automaton

DOI10.1007/978-3-319-09039-9_4MaRDI QIDQ4982991zbMATH OpenOpenAlexFDO

Authors Zhe Dang, Oscar H. Ibarra, Qin Lin

Publication date 14 April 2015

Published in Automata, Universality, Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09039-9_4

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Accepting runs in a two-way finite automaton
• Sampling automata and programs
• Two-way finite automata: old and recent results
• scientific article; zbMATH DE number 1318511
• On the State Complexity of Operations on Two-Way Finite Automata

Cited in

(3)

• Accepting runs in a two-way finite automaton
• Sampling automata and programs
• Sampling different kinds of acyclic automata using Markov chains

This page was built for publication: Sampling a two-way finite automaton

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