227 search results - page 10 / 46 » P Systems and Finite Automata |
ICDAR
1995
IEEE
14 years 1 months ago
1995
IEEE
This paper describes substantial advances in the analysis (parsing) of diagrams using constraint grammars. The addition of set types to the grammar and spatial indexing of the dat...
LATA
2010
Springer
14 years 2 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
CONCUR
2006
Springer
13 years 12 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
ENTCS
2006
13 years 10 months ago
2006
We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...
DCC
1999
IEEE
13 years 9 months ago
1999
IEEE