Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-19T13:30:07.058Z Has data issue: false hasContentIssue false
  • English
  • Français

An innovative finite state concept for recognition and parsing of context-free languages

Published online by Cambridge University Press:  01 December 1996

M. J. NEDERHOF  and
E. BERTSCH
M. J. NEDERHOF
Affiliation:
University of Groningen, Humanities Computing, P.O. Box 716, NL-9700 AS Groningen, The Netherlands. e-mail: [email protected]
E. BERTSCH
Affiliation:
Ruhr University, Faculty of Mathematics, Universitätsstraße 150, D-44780 Bochum, Germany. e-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

In the full paper in the companion volume, we introduce a new subclass of the context free languages, the meta-deterministic languages, which includes the deterministic languages, but also the languages that result if deterministic languages are combined via regular expressions.

Type
Research Article
Information
Natural Language Engineering , Volume 2 , Issue 4 , December 1996 , pp. 381 - 382
Copyright
1997 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)