REGULAR EXPRESSIONS IN A PROGRAM COMPLEXITY METRICMAGEL K.1981; SIGPLAN NOT.; ISSN 0362-1340; USA; DA. 1981; VOL. 16; NO 7; PP. 61-65; BIBL. 6 REF.Article

THE STAR HEIGHT OF RESET-FREE EVENTS AND STRICTLY LOCALLY TESTABLE EVENTSHASHIGUCHI K; HONDA N.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 40; NO 3; PP. 267-284; BIBL. 11 REF.Article

CONVERSION OF REGULAR EXPRESSIONS INTO MINIMAL STATE DIAGRAMS.VEELENTURF LPJ.1977; DIGIT. PROCESS.; SWITZ.; DA. 1977; VOL. 3; NO 2; PP. 105-120; ABS. FR. ALLEM.; BIBL. 9 REF.Article

ECONOMICAL SYNTHESIS OF REGULAR EXPRESSIONS FOR LARGE-STATE SEQUENTIAL MACHINESBABU THOMAS; CHANDRASEKHARAN PC.1981; INT. J. ELECTRON. THEOR. EXP.; ISSN 0020-7217; GBR; DA. 1981; VOL. 51; NO 3; PP. 241-246; BIBL. 4 REF.Article

THE COMPLEXITY OF THE INEQUIVALENCE PROBLEM FOR REGULAR EXPRESSIONS WITH INTERSECTIONFUERER M.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 234-245; BIBL. 12 REF.Conference Paper

THE EMPTINESS OF COMPLEMENT PROBLEM FOR SEMI EXTENDED REGULAR EXPRESSIONS REQUIRES C^N SPACESROBSON JM.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 5; PP. 220-222; BIBL. 5 REF.Article

FINITE AUTOMATA, DEFINABLE SETS, AND REGULAR EXPRESSIONS OVER CO^N-TAPESCHOUEKA Y.1978; J. COMPUTER SYST. SCI.; USA; DA. 1978; VOL. 17; NO 1; PP. 81-97; BIBL. 14 REF.Article

PROGRAM GRAPHS AND EXECUTION BEHAVIOROLDEHOEFT RR.1983; IEEE TRANSACTIONS ON SOFTWARE ENGINEERING; ISSN 0098-5589; USA; DA. 1983; VOL. 9; NO 1; PP. 103-108; BIBL. 4 REF.Article

A LUBRICANT FOR DATA FLOW ANALYSISROSEN BK.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 3; PP. 493-511; BIBL. 9 REF.Article

THE COMPLEXITY OF RESTRICTED REGULAR EXPRESSIONS AND THE SYNTHESIS PROBLEM FOR FINITE AUTOMATALEISS E.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 23; NO 3; PP. 348-354; BIBL. 10 REF.Article

SYNTAKTYCZNE ROZPOZNAWANIE KSZTALTU OBROTOWYCH ELEMENTOW MASZYN = RECONNAISSANCE SYNTAXIQUE DES ELEMENTS D'UNE MACHINE ROTATIVEJAKUBOWSKI R; KASPRZAK A.1979; PODSTAWY STEROWAN.; POL; DA. 1979; VOL. 9; NO 4; PP. 359-380; ABS. ENG/RUS; BIBL. 14 REF.Article

ON A LIST TRANSFORMATION FROM A REGULAR EXPRESSION TO ITS CAMBRIDGE-POLISH NOTATION BY A LISP FUNCTIONHYEN YEAL LEE.1978; MEM. FAC. SCI. KYUSHU UNIV., A; JPN; DA. 1978; VOL. 32; NO 2; PP. 313-317; BIBL. 4 REF.Article

ON THE COMPLEXITY OF MINIMUM INFERENCE OF REGULAR SETSANGLUIN D.1978; INFORM. AND CONTROL; USA; DA. 1978; VOL. 39; NO 3; PP. 337-350; BIBL. 2 P.Article

AN LR PARSING TECHNIQUE FOR EXTENDED CONTEXT-FREE GRAMMARSCELENTANO A.1981; COMPUT. LANG.; ISSN 0096-0551; USA; DA. 1981; VOL. 6; NO 2; PP. 95-107; BIBL. 15 REF.Article

CHARACTERIZING THE REGULAR PREFIX CODES AND RIGHT POWER-BOUNDED LANGUAGESVELOSO PAS.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 1; PP. 5-7; BIBL. 8 REF.Article

CHARACTERIZATIONS FOR THE REGULAR PREFIX CODES AND RELATED FAMILIESVELOSO PAS.1980; INT. J. COMPUT. INF. SCI.; ISSN 0091-7036; USA; DA. 1980; VOL. 9; NO 5; PP. 371-382; BIBL. 9 REF.Article

THE ROLE OF FINITE AUTOMATA IN THE DEVELOPMENT OF MODERN COMPUTING THEORYCONSTABLE RL.1980; STUD. LOGIC FOUND. MATH.; NLD; DA. 1980; VOL. 101; PP. 61-83; BIBL. 3 P.Conference Paper

ON UNIVERSALITY OF CONCURRENT EXPRESSIONS WITH SYNCHRONIZATION PRIMITIVESITO T; NISHITANI Y.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 19; NO 1; PP. 105-115; BIBL. 8 REF.Article

FORMAL BEHAVIOURAL SPECIFICATION OF CONCURRENT SYSTEMS WITHOUT GLOBALITY ASSUMPTIONSLAUER PE; SHIELDS MW; COTRONIS JY et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 107; PP. 115-151; BIBL. 3 P.Conference Paper

FORMAL DESCRIPTION OF COMMUNICATION BEHAVIORKIMURA T.1979; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS/1979-03-28/BALTIMORE MD; USA; BALTIMORE: THE JOHNS HOPKINS UNIVERSITY; DA. 1979; PP. 286-291; BIBL. 12 REF.Conference Paper

ON THE PERIODICITY OF REGULAR LANGUAGESKAI HWANG.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 40; NO 2; PP. 205-222; BIBL. 14 REF.Article

Unicode Canonical Decomposition for Hangeul Syllables in Regular ExpressionHEE YUAN TAN; LIM, Hyotaek.IEICE transactions on information and systems. 2011, Vol 94, Num 1, pp 146-154, issn 0916-8532, 9 p.Article

Regular expressions with nested levels of back referencing form a hierarchyLARSEN, K. S.Information processing letters. 1998, Vol 65, Num 4, pp 169-172, issn 0020-0190Article

FAST ALGORITHMS FOR SOLVING PATH PROBLEMSTARJAN RE.1981; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1981; VOL. 28; NO 3; PP. 594-614; BIBL. 31 REF.Article

A FIXED-POINT THEOREM FOR RECURSIVE-ENUMERABLE LANGUAGES AND SOME CONSIDERATIONS ABOUT FIXED-POINT SEMANTICS OF MONADIC PROGRAMSISTRAIL S.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 289-303; BIBL. 7 REF.Conference Paper