Learning two-tape automata from queries and counterexamples

DOI10.1007/BF01201279zbMath0849.68083OpenAlexW2082850768WikidataQ124969694 ScholiaQ124969694MaRDI QIDQ4879209

Takashi Yokomori

Publication date: 27 May 1996

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01201279

zbMATH Keywords

deterministic finite automatalearning problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Some decisional problems on rational relations ⋮ Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries ⋮ Learning algorithms ⋮ Even linear simple matrix languages: formal language properties and grammatical inference.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning regular sets from queries and counterexamples
• Grammatical inference for even linear languages based on control sets
• When won't membership queries help?
• Sets recognized by n-tape automata
• Regular prefix relations
• On Relations Defined by Generalized Finite Automata
• The theory of sequential relations
• A machine realization of the linear context-free languages
• Generalizations of regular events

This page was built for publication: Learning two-tape automata from queries and counterexamples