Results 31 to 40 of about 698,419 (89)
Sublinearly space bounded iterative arrays [PDF]
, 2007 Iterative arrays (IAs) are a, parallel computational model with a sequential processing of the input. They are one-dimensional arrays of interacting identical deterministic finite automata.
Malcher, Andreas +2 more
core
Formalization of the DE2 Language [PDF]
, 2005 We formalized the DE2 hierarchical, occurrence-oriented finite state machine (FSM) language, and have developed a proof theory allowing the mechanical verification of FSM descriptions. Using the ACL2 functional logic, we have defined a predicate for detecting the well-formedness of DE2 expressions.
Erik Reeber, Warren A. Hunt
openaire +1 more source
A formal language for cyclic operads
Higher Structures, 2017 We propose a $ $-calculus-style formal language, called the $ $-syntax, as a lightweight representation of the structure of cyclic operads. We illustrate the rewriting methods behind the formalism by giving a complete step-by-step proof of the equivalence between the unbiased and biased definitions of cyclic operads.
Curien, Pierre-Louis, Obradovic, Jovana
openaire +3 more sources
Does the Principle of Compositionality Explain Productivity? For a Pluralist View of the Role of Formal Languages as Models [PDF]
, 2017 One of the main motivations for having a compositional semantics is the account of the productivity of natural languages. Formal languages are often part of the account of productivity, i.e., of how beings with finite capaci- ties are able to produce and
Perini-Santos, Ernesto
core
Formal Properties of XML Grammars and Languages
, 2000 XML documents are described by a document type definition (DTD). An XML-grammar is a formal grammar that captures the syntactic features of a DTD. We investigate properties of this family of grammars.
Berstel, Jean, Boasson, Luc
core +1 more source
Formal translations and Szilard languages
Information and Control, 1976 One of the methods for defining translations is the so called syntax-directed translation scheme which can be interpreted as a pair of rather similar grammars with the productions working in parallel. Because of the similarity of the grammars each of the two grammars “fits” the other in the sense that for each derivation process in one grammar leading ...
Hermann A. Maurer, Hans-Peter Kriegel
openaire +2 more sources
Hairdressing in groups: a survey of combings and formal languages
, 1997 A group is combable if it can be represented by a language of words satisfying a fellow traveller property; an automatic group has a synchronous combing which is a regular language.
Rees, Sarah
core +1 more source
The Notion of Truth in Natural and Formal Languages [PDF]
For any natural (human) or formal (mathematical) language L we know that an expression X of language L is true if and only if there are expressions Γ of language L that connect X to known facts.
Olcott, Pete
core