On inferring zero-reversible languages

Erkki Mäkinen

Skip to main content Skip to main navigation menu Skip to site footer

On inferring zero-reversible languages

Erkki Mäkinen

Abstract

We use a language-theoretic result for zero-reversible languages to show that there exists a linear time inference method for this class of languages using positive data only.

Downloads

Download data is not yet available.

PDF

Published

2000-01-01

How to Cite

Mäkinen, E. (2000). On inferring zero-reversible languages. Acta Cybernetica, 14(3), 479-484. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3541

Download Citation

Issue

Vol 14 No 3 (2000)

Section

Regular articles

Most read articles by the same author(s)

Erkki Mäkinen, On lexicographic enumeration of regular and context-free languages , Acta Cybernetica: Vol 13 No 1 (1997)
Takeshi Koshiba, Erkki Mäkinen, Yuji Takada, Inferring pure context-free languages from positive data , Acta Cybernetica: Vol 14 No 3 (2000)
Johannes Koskinen, Erkki Mäkinen, Tarja Systä, Implemeting a component-based tool for interactive synthesis of UML statechart diagrams , Acta Cybernetica: Vol 15 No 4 (2002)
Outi Sievi-Kortej, Erkki Mäkinen, Timo Poranen, Simulated annealing for aiding genetic algorithm in software architecture synthesis , Acta Cybernetica: Vol 21 No 2 (2013)
Erkki Mäkinen, A Note on the Emptiness of Intersection Problem for Left Szilárd Languages , Acta Cybernetica: Vol 22 No 3 (2016)