Inference of deterministic one-counter languages

DOI10.1016/0020-0255(84)90048-3MaRDI QIDQ794442zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 1984

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(84)90048-3

zbMATH Keywords

enumerationgrammatical inferenceidentification in the limitcomputation tracesdeterministic one- counter automatadeterministic one-counter languagesinference algorithms

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Learning Regular Languages Using Nondeterministic Finite Automata
• Inference of finite automata using homing sequences
• A Family of Algorithms for Non Deterministic Regular Languages Inference
• scientific article; zbMATH DE number 67617
• scientific article; zbMATH DE number 4060763

Cites work

• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3407175 (Why is no real title available?)
• A solution of the syntactical induction-inference problem for regular languages
• Deterministic one-counter automata
• Grammar enumeration and inference
• Grammatical Inference: Introduction and Survey - Part II
• Inference of Reversible Languages
• Language identification in the limit
• System identification via state characterization

Cited in

(4)

• Grammatical Inference: Algorithms and Applications
• One-way permutations and self-witnessing languages
• Deciding determinism of unary languages
• One-counter automata for parsing and language approximation

This page was built for publication: Inference of deterministic one-counter languages

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