Inference of deterministic one-counter languages

DOI10.1016/0020-0255(84)90048-3zbMath0541.68051OpenAlexW2079632779MaRDI QIDQ794442

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Deterministic one-counter automata
• System identification via state characterization
• Inference of Reversible Languages
• Grammatical Inference: Introduction and Survey - Part II
• Grammar enumeration and inference
• A solution of the syntactical induction-inference problem for regular languages
• Language identification in the limit

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