主要讨论了稠密相对正则语言的一些性质。
Some properties of dense relatively regular languages are studied.
给出了（确定）格值正则文法与（确定）格值正则语言的定义。
The concepts of (deterministic) lattice-valued regular grammars(DLRG and LRG, respectively) and (deterministic) lattice-valued regular languages are formulated.
从正则语言识别的角度证明了正则语言的识别系统确定有限自动机所识别的语言集是一个递归可枚举集，同时讨论了正则语言的可递归性。
The theorem that the language set distinguished deterministic finite automaton is a recursively enumerable set was proved, and then, the recursiveness of regular language was analyzed.
用时间自动机验证一个有穷状态实时系统的正确性，可归结为判定两个时间正则语言的包含问题，亦可归结为判定两个时间正则语言的交是否为空的问题。
To verify the correctness of the finite state real time system by timed automaton can come down to the inclusion of two timed regular languages.
如果您发现或发明了该语言的某种经过微小更新的变体，将它和ebnf语法一起使用要比和那些正则表达式一起使用简单得多。
If you discover or invent some slightly new variant of the language, it is a lot easier to play with the EBNF grammar than with those regular expressions.
它定义了一种xml语言，可用于定义新类型的词汇表示的正则表达式。
It defines an XML language for defining regular expressions for the lexical representation of new types.
尽管词法分析不是必须通过正则表达式来完成，但是它们往往可以便捷地解决程序编制和数据语言的难题。
While lexing does not have to be done through regular expressions, they tend to be a handy vehicle through the jungle of programming and data languages.
与一般的翻译不同，将正则表达式转换成国际化版本是数据格式专家的工作，而不是语言专家的工作。
Unlike normal translation, conversion of the regular expression into an internationalized version is done by a data-format expert, not a language expert.
而其内置的字符串操纵函数(包括正则表达式)，以及程序上的特性和方便性使它成为创建简单“脚本”程序的理想语言。
And its built-in string manipulation functions (including regular expressions), as well as procedural and convenience features make it the ideal language for creating simple "scripting" programs.
查找可帮助您了解如何为各种程序和语言构建正则表达式的可用工具和技术。
Discover the available tools and techniques that can help you learn how to construct regular expressions for various programs and languages.
正则表达式在计算机语言理论中有很长的历史。
Regular expressions have their roots in computer language theory.
在您学会正则表达式的语法(也许相当晦涩)之后，就可以将您的专业知识灵活运用到不同的工具、编程语言和操作系统。
Once you learn the (admittedly cryptic) syntax of regular expressions, you can transfer your expertise among tools, programming languages, and operating systems.
在编程中，正则表达式是用一种形式语言编写的，也称为regex或regexp。
In programming, a regular expression is written in a formal language, also known as regex or regexp.
许多其他UNIX工具，包括交互式编辑器vi和Emacs、流编辑器sed 和awk，以及所有现代编程语言都支持正则表达式。
Many other UNIX tools, including interactive editors vi and Emacs, stream editors sed and awk, and all modern programming languages, also support regular expressions.
如果已经在其它编程语言中使用正则表达式，那么Scala的应该不会让你感觉到惊讶。
Regexes in Scala should contain no surprises if you've used them in other programming languages.
XSL转换语言的下一版本目前还处于开发和评审中，它包含了一个将正则表达式添加到该语言的提议。
The next version of the XSL transformation language, which is still under development and review, includes a proposal to add regular expressions to the language.
现有方法可能涉及根据词的词干或变音位构建正则表达式，以及其他搜索词的语言派生词。
Existing approaches might involve building a regular expression based on stems of a word, or metaphone, and other linguistic derivatives of a search term.
这三种语言都支持正则表达式和模式匹配。
Our three languages also share support for regular expressions and pattern matching.
正则表达式基本上就是为进行文本处理而构建的一种小型的子语言，用来进行字符串的匹配和替换。
Regular expressions are basically a small sub-language built for text processing, used to match and replace strings of characters.
用来实际处理正则表达式的语言并不是Perl，而是一种该领域特有的语言，Perl正好可以使用这种语言。
The language for doing a regular expression is not Perl; it is a domain-specific language that Perl happens to have a hook into.
正则表达式(regular expression,regexp)是用于描述字符串集的匹配模式的概念，在很多程序和语言中都是通用的。
The concept of regular expressions (regexps) -a notation for describing a pattern that matches a set of strings-is common across many programs and languages.
我认为，Perl5的正则表达式的晦涩，也正是这门语言如此强大的原因之一，尽管它同时还相当难以维护。
In my opinion, the density of Perl 5's regular expressions is one of the reasons why the language is so powerful, while at the same time fairly hard to maintain.
正则表达式是几乎所有现代编程语言的共有特性之一，通常被简称为regexes（regex 的复数，Regular Expression 的简称）。
Commonly referred to as regexes, regular expressions are a feature of nearly all modern programming languages.
各种XML查询语言的共同特点就是利用正则路径表达式(RPE)来导航XML文档的查询。
The common feature of the XML query languages is the use of regular path expressions (i. e. RPE) to query XML data.
本文证明了确定语言对与正则集的无穷次商封闭。
In this paper, we prove: the deterministic languages are closed under infinite quotient with the regular languages.
正则表达式语言是世界上最流行的字符串匹配语言，它被许多编程语言或工具所支持。
Regular expression is the most popular language in the world, which is used to match character stream and supported by many programming languages or tools.
关于正则S-（后缀）语言，我们也有平行的结果。
With regard to regular S (suffix)-languages, we have obtained a parallel result as well.
正则表达式语言是世界上最流行的字符串匹配语言。
Regular expression is the most popular string matching language in the world.
设计和实现了汉语数据库自然语言查询接口系统（IDCQ），系统包括正则分词子系统和对象语义解析子系统；
The design and implementation of the Interface for Database Query in Chinese (IDCQ). The system includes regular word segmentation subsystem and object semantic analysis subsystem.
正则表达式语言元素主题。
应用推荐