205 search results - page 19 / 41 » Testing the Equivalence of Regular Languages |
108
click to vote
MFCS
2007
Springer
15 years 6 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
TACS
2001
Springer
15 years 4 months ago
2001
Springer
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
CSR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...
TAGT
1994
Springer
15 years 3 months ago
1994
Springer
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
CICLING
2007
Springer
15 years 6 months ago
2007
Springer
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages. The attractiveness of this technology for natural lang...