A
Alphabet,in the context of formal languages can be any set,although it often makes sense to use an alphabet in the usual sense of the word,or more generally a character set such as ASCII. The elements of an alphabet are called its letters.
Ambiguous grammar is grammar whose language contains at least one ambiguous sentence. Grammar of the sentences containing no ambiguous grammar is unambiguous.
Ambiguous sentence is the sentence for which there is more than one syntactic tree.
Automaton over the alphabet A is a system A=(S,f),where S –is any finite set called the set of states,and f:S x A → S –is a transition function.
B
BNF (Backus Normal Form or Backus–Naur Form) is a notation technique for contex-free grammars,often used to describe the syntax of languages used in computing,such as computer programmingd languages,document formats,instruction sets and communication protocols. It is applied wherever exact descriptions of languages are needed,for instance,in official language specifications,in manuals,and in textbooks on programming language theory.
Business Process Modeling Notation (BPMN) is a graphical representation for specifying business processes in a business process model. BPMN was developed by Business Process Management Inititaive. The objective of BPMN is to support business process management for both technical users and business users by providing a notation that is intuitive to business users yet able to represent complex process semantics.
C
Chomsky hierarchy is classification of grammars and languages introduced by Noam Chomsky.
Compilation is the translation of source code into object code by a compiler.
Compiler is a computer program (or set of programs) that transforms source code written in a programming language into another computer language.
Context-free grammars (Type-2 grammars) generate the context-free languages. These are defined by rules of the form A → γ with A a nonterminal and γ a string of terminals and nonterminals. These languages are exactly all languages that can be recognized by a non-deterministic pushdown automaton. Context-free languages are the theoretical basis for the syntax of most programming languages.
Context-sensitive grammars (Type-1 grammars) generate the context-sensitive languages. These grammars have rules of the form α A β → α γ β with A a nonterminal and α,β and γ strings of terminals and nonterminals. The strings α and β may be empty,but γ must be nonempty. The languages described by these grammars are exactly all languages that can be recognized by a linear bounded automaton.
D
Deterministic finite automaton AD is a 5-tuple AD = <N,V,M,S,Z>,where:
N –a finite set of states
V- a finite set of input symbols called the alphabet
M –a transition function M:(N x V) &rorr;N
S –a start state
Z –a set od accept states
E
Exclusive Choice -the Exclusive Choice pattern is defined as being a location in a process where the flow is “split” into twoor more exclusive alternative paths. The pattern is exclusive in that only one of the alternative paths maybe chosen for the process to continue.
F
Finite-state automaton is a mathematical abstraction sometimes used to design digital logic or computer programs. It is a behavior model composed of a finite number of states,transitions between those states,and actions,similar to a flow graph in which one can inspect the way logic runs when certain conditions are met.
Formal grammar is a set of formation rules for strings in a formal language. The rules describe how to form strings from the language’s alphabet that are valid according to the language’s syntax. A grammar does not describe the meaning of the strings or what can be done with them in whatever context — only their form.
Formal language is a set of words,i.e. finite strings of letters,symbols or tokens. In computer science they are used for the precise definition of data formats and the syntax of programming languages.
I
Interpreter is a computer program that executes,i.e. performs ,instructions written in a programming language.
L
Language is an organized system of signs,symbols and rules.
M
Metalanguage is language or symbols used when language itself is being discussed or examined. Expressions in a metalanguage are often distinguished from those in an object language by the use of italics,quotation marks,or written on a separate line.
N
Natural language may refer either to the specifically human capacity for acquiring and using complex systems of communication,or to a specific instance of such a system of complex communication. Natural language can be based on visual rather than auditive stimuli,for example in sign languages and written language.
Nondeterministic finite automaton AN is a 5-tuple AN = <N,V,M,S,Z>,where:
N –a finite set od states
V- a finite set of input symbols
M –a transition function M:(N x V) ->2^N
S –an initial state
Z –a set od states distinguished as accepting states
P
Parallel Split-the Parallel Split pattern is defined as being a mechanism that will allow activities to be performed concurrently,rather than serially. A single path through the process is split into two or more paths so that two or more activities will start at the same time.
Pragmatics is a subfield of linguistics which studies the ways in which context contributes to meaning. It studies how the transmission of meaning depends not only on the linguistic knowledge of the speaker and listener,but also on the context of the utterance,knowledge about the status of those involved,the inferred intent of the speaker.
R
Recursively enumerable grammar (Type-0 grammars) include all formal grammars. They generate exactly all languages that can be recognized by a Turing machine. These languages are also known as the recursively enumerable languages. Note that this is different from the recursive languages which can be decided by an always-halting Turing machine.
Regular grammars (Type-3 grammars) generate the regular languages. Such a grammar restricts its rules to a single nonterminal on the left-hand side and a right-hand side consisting of a single terminal,possibly followed (or preceded,but not both in the same grammar) by a single nonterminal. The rule S → ε is also allowed here if S does not appear on the right side of any rule. These languages are exactly all languages that can be decided by a finite state automaton. Additionally,this family of formal languages can be obtained by regular expresions. Regular languages are commonly used to define search patterns and the lexical structure of programming languages.
S
Semantics is the study of meaning. It focuses on the relation between signifiers ,such as words,phrases,signs and symbols,and what they stand for,their denotata. Linguistic semantics is the study of meaning that is used by humans to express themselves through language. Other forms of semantics include the semantics of programming languages,formal logics,and semitoics.
Sentence diagram is a pictorial representation of the gramatical structure of a natural-language sentence. A sentence diagram is a form of a parse tree.
Sequence -the Sequence pattern is defined as being an ordered series of activities,with one activity starting after aprevious activity has completed.
Simple Merge -the Simple Merge pattern is defined as being a location in a process where a set of alternative paths isjoined into a single path.
Syntax is the study of the principles and rules for constructing sentences in natural languages.
T
Translator is a computer program that translates one programming language instruction(s) into another programming language instruction(s) without the loss of original meaning. Or,the translator will translate X language and produce X’ language. In some advanced translator will even change the logic (not meaning) or will simplify the logic without losing the essence.
W
Word is the smallest free form that may be uttered in isolation with semantic or pragmatic content.
Word length is the number of symbols contained in the chain.
Worflow Patterns describe the behavior of business processes. The patterns range from very simple to very complex and cover the behaviors that can be captured within most business process models.
