Polynomial time identification of strict deterministic restricted one-counter automata in some class from positive data

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3264, Issue , 2004, Pages 260-272

  Wakatsuki, Mitsuo ^a   Teraguchi, Kiyoshi ^a   Tomita, Etsuji ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORMAL LANGUAGES; IDENTIFICATION (CONTROL SYSTEMS); POLYNOMIALS; REAL TIME SYSTEMS; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS); COMPUTATIONAL GRAMMARS; INFERENCE ENGINES; POLYNOMIAL APPROXIMATION;

POLYNOMIAL TIME IDENTIFICATION; POSITIVE DATA; STRICT DROCA; TIME COMPLEXITY; COUNTER AUTOMATA; DETERMINISTIC PUSHDOWN AUTOMATA; IDENTIFIABILITY; POLYNOMIAL SIZE; POLYNOMIAL-TIME;

AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS;

EID: 22944440060     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30195-0_23     Document Type: Conference Paper

References (9)

1. Angluin, D., Inductive inference of formal languages from positive data, Inform. and Control 45 (1980), 117-135.
2. Angluin, D., Inference of reversible languages, J. ACM 29 (1982), 741-765.
3. Berstel, J., "Transductions and Context-Free Languages", Teubner Studienbücher, Stuttgart, 1979.
4. Gold, E. M., Language identification in the limit, Inform, and Control 10 (1967), 447-474.
5. Higuchi, K., E. Tomita and M. Wakatsuki, A polynomial-time algorithm for checking the inclusion for strict deterministic restricted one-counter automata, IEICE Trans. on Information and Systems ET8-D (1995), 305-313.
6. Mäkinen, E., The grammatical inference problem for the Szilard languages of linear grammars, Inform. Process. Lett. 36 (1990), 203-206.
7. Pitt, L., Inductive inference, DFAs, and computational complexity, Proc. 2nd Workshop on Analogical and Inductive Inference, Lecture Notes in Artificial Intelligence, Springer, Berlin 397 (1989), 18-44.
8. Tomita, E., A direct branching algorithm for checking equivalence of some classes of deterministic pushdown automata, Inform. and Control 52 (1982), 187-238.
9. Yokomori, T., Polynomial-time identification of very simple grammars from positive data, Theoret. Comput. Sci. 298 (2003), 179-206.