Regular expressions of conditions for processing language modelling

Authors:
Popa Marin Emil
Affiliations:
Department of Computer Science, Lucian Blaga University of Sibiu, Faculty of Sciences, Sibiu, Romania
Venue:
MMACTEE'06 Proceedings of the 8th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
Year:
2006

Citing 4
Cited 2

Algebraic tools for language processing

Computer Languages
Full AFLS and nested iterated substitution

SWAT '69 Proceedings of the 10th Annual Symposium on Switching and Automata Theory (swat 1969)
Substitution expressions

Journal of Computer and System Sciences
A characterization of context-free languages

Journal of Computer and System Sciences

Multi level recursive specifications for context free grammars

ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
Aspects of dictionary making developing an in-house text parsing tool

WSEAS Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

The generalized regular expressions were introduced by I. Gruska [2]. We can find similar results in [1], [3], [4] and [7]. Using the given by results T. Rus [6], we define in this paper the generalized regular expressions of conditions.