scispace - formally typeset
Search or ask a question
Topic

Formal language

About: Formal language is a research topic. Over the lifetime, 5763 publications have been published within this topic receiving 154114 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: This paper applies the method to obtain simple demonstrations of Faa di Bruno's formula, and some identities concerning Bell polynomials, Stirling numbers and symmetric functions, and sees that Cayley's formula on labeled trees is equivalent to the Lagrange inversion formula.

72 citations

Book
01 Jan 1993
TL;DR: This paper presents an algebraization of algorithmics: algebras and combinators cumulative logic programs and modelling formal models of computation in which data are processes - theory and applications and others.
Abstract: Part 1 Axiomatics and logics of algorithmic properties: algorithmic properties of structures formal languages - automata and structures proof theory and the accuracy of computations. Part 2 Galois-connections and structure of problem classes: on the solvability of algorithmic problems lower bounds by Galois theory towards a Galois theory of algorithmic problems. Part 3 An algebraization of algorithmics: algebras and combinators cumulative logic programs and modelling formal models of computation in which data are processes - theory and applications and others.

72 citations

BookDOI
01 Jan 1997
TL;DR: The first € price and the £ and $ price are net prices, subject to local VAT, and the €(D) includes 7% for Germany, the€(A) includes 10% for Austria.
Abstract: The first € price and the £ and $ price are net prices, subject to local VAT. Prices indicated with * include VAT for books; the €(D) includes 7% for Germany, the €(A) includes 10% for Austria. Prices indicated with ** include VAT for electronic products; 19% for Germany, 20% for Austria. All prices exclusive of carriage charges. Prices and other details are subject to change without notice. All errors and omissions excepted. G. Paun, A. Salomaa (Eds.) New Trends in Formal Languages

72 citations

Journal ArticleDOI
H. Ney1
TL;DR: A dynamic programming algorithm for recognizing and parsing spoken word strings of a context-free grammar that performs all functions simultaneously, namely, time alignment, work boundary detection, recognition, and parsing, provides a closed-form solution.
Abstract: The use of context-free grammars in automatic speech recognition is discussed A dynamic programming algorithm for recognizing and parsing spoken word strings of a context-free grammar is presented The time alignment is incorporated in to the parsing algorithm The algorithm performs all functions simultaneously, namely, time alignment, work boundary detection, recognition, and parsing As a result, no postprocessing is required From the probabilistic point of view, the algorithm finds the most likely explanation or derivation for the observed input string, which amounts to Viterbi scoring rather than Baum-Welch scoring in the case of regular or finite-state languages The algorithm provides a closed-form solution The computational complexity of the algorithm is studied Details of the implementation and experimental tests are described >

72 citations

Proceedings ArticleDOI
23 Jun 2005
TL;DR: It is shown that Constraint LTL over the simple domain augmented with the freeze operator is undecidable which is a surprising result regarding the poor language for constraints (only equality tests).
Abstract: Constraint LTL, a generalization of LTL over Presburger constraints, is often used as a formal language to specify the behavior of operational models with constraints. The freeze quantifier can be part of the language, as in some real-time logics, but this variable-binding mechanism is quite general and ubiquitous in many logical languages (first-order temporal logics, hybrid logics, logics for sequence diagrams, navigation logics, etc.). We show that Constraint LTL over the simple domain augmented with the freeze operator is undecidable which is a surprising result regarding the poor language for constraints (only equality tests). Many versions of freeze-free constraint LTL are decidable over domains with qualitative predicates and our undecidability result actually establishes /spl Sigma//sub 1//sup 1/ -completeness. On the positive side, we provide complexity results when the domain is finite (EXPSPACE-completeness) or when the formulae are flat in a sense introduced in the paper.

72 citations


Network Information
Related Topics (5)
Data structure
28.1K papers, 608.6K citations
87% related
Time complexity
36K papers, 879.5K citations
86% related
Graph (abstract data type)
69.9K papers, 1.2M citations
85% related
Semantics
24.9K papers, 653K citations
85% related
Component-based software engineering
24.2K papers, 461.9K citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20237
202237
2021113
2020175
2019173
2018142