Sciweavers

762 search results - page 12 / 153
» Intercode Regular Languages
Sort
View
ICALP
2007
Springer
14 years 1 months ago
Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
Marcelo Arenas, Pablo Barceló, Leonid Libki...
ADBIS
2000
Springer
106views Database» more  ADBIS 2000»
13 years 11 months ago
Using XML and Regular Expressions in the Syntactic Analysis of Inflectional Language
In this paper we describe an approach to representation of data and knowledge using two technologies: XML and regular expressions in a domain of natural language syntactic analysis...
Marek Trabalka, Mária Bieliková
ICGI
2010
Springer
13 years 8 months ago
Inferring Regular Trace Languages from Positive and Negative Samples
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
Antonio Cano Gómez
AUTOMATICA
2005
108views more  AUTOMATICA 2005»
13 years 7 months ago
Robust optimal control of regular languages
This paper presents an algorithm for robust optimal control of regular languages under specified uncertainty bounds on the event cost parameters of the language measure that has b...
Constantino M. Lagoa, Jinbo Fu, Asok Ray
FUIN
2010
89views more  FUIN 2010»
13 years 6 months ago
Computing Maximal Error-detecting Capabilities and Distances of Regular Languages
Abstract. A (combinatorial) channel consists of pairs of words representing all possible inputoutput channel situations. In a past paper, we formalized the intuitive concept of “...
Stavros Konstantinidis, Pedro V. Silva