2664 search results - page 11 / 533 » Theory by Process |
FSEN
2009
Springer
14 years 2 months ago
2009
Springer
Automata theory presents roughly three types of automata: finite automata, pushdown automata and Turing machines. The automata are treated as language acceptors, and the expressiv...
CONCUR
2008
Springer
13 years 9 months ago
2008
Springer
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
JOLLI
1998
13 years 7 months ago
1998
This paper shows how proof nets can be used to formalize the notion of “incomplete dependency” used in psycholinguistic theories of the unacceptability of center-embedded const...
CONCUR
2009
Springer
14 years 2 months ago
2009
Springer
Theories identifying well-formed systems of processes—those that are free of communication errors and enjoy strong properties such as deadlock freedom—are based either on sessi...
BPM
2006
Springer
13 years 10 months ago
2006
Springer
The theory of regions and the algorithms for synthesizing a Petri net model from a transition system, which are based on this theory, have interesting practical applications