Sciweavers

16 search results - page 1 / 4
» On automata and language based grammar metrics
Sort
View
COMSIS
2010
13 years 2 months ago
On automata and language based grammar metrics
Abstract. Grammar metrics have been introduced to measure the quality and the complexity of the formal grammars. The aim of this paper is to explore the meaning of these notions an...
Matej Crepinsek, Tomaz Kosar, Marjan Mernik, Julie...
LACL
1998
Springer
13 years 8 months ago
Lambek Calculus Proofs and Tree Automata
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
Hans-Jörg Tiede
ENTCS
2008
125views more  ENTCS 2008»
13 years 4 months ago
Extending Lustre with Timeout Automata
This paper describes an extension to Lustre to support the analysis of globally asynchronous, locally synchronous (GALS) architectures. This extension consists of constructs for d...
Jimin Gao, Mike Whalen, Eric Van Wyk
DAGM
2008
Springer
13 years 6 months ago
Natural Language Understanding by Combining Statistical Methods and Extended Context-Free Grammars
This paper introduces an novel framework for speech understanding using extended context-free grammars (ECFGs) by combining statistical methods and rule based knowledge. By only us...
Stefan Schwärzler, Joachim Schenk, Frank Wall...
CORR
2000
Springer
133views Education» more  CORR 2000»
13 years 4 months ago
On Exponential-Time Completeness of the Circularity Problem for Attribute Grammars
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
Pei-Chi Wu