[图书][B] Automata theory and its applications
B Khoussainov, A Nerode - 2012 - books.google.com
The theory of finite automata on finite stings, infinite strings, and trees has had a dis
tinguished history. First, automata were introduced to represent idealized switching circuits …
tinguished history. First, automata were introduced to represent idealized switching circuits …
Representation of computations in concurrent automata by dependence orders
F Bracho, M Droste, D Kuske - Theoretical Computer Science, 1997 - Elsevier
An automaton with concurrency relations A is a labelled transition system with a collection of
binary relations indicating when two actions in a given state of the automaton can occur …
binary relations indicating when two actions in a given state of the automaton can occur …
Nondeterministic automata with concurrency relations and domains
D Kuske - Colloquium on Trees in Algebra and Programming, 1994 - Springer
We introduce an operational model of concurrent systems, called nondeterministic automata
with concurrency relations. These are nondeterministic labelled transition systems where the …
with concurrency relations. These are nondeterministic labelled transition systems where the …
Labelled domains and automata with concurrency
F Bracho, M Droste - Theoretical computer science, 1994 - Elsevier
We investigate an operational model of concurrent systems, called automata with
concurrency relations. These are labelled transition systems A in which the event set is …
concurrency relations. These are labelled transition systems A in which the event set is …
Recognizable languages in concurrency monoids
M Droste - Theoretical Computer Science, 1995 - Elsevier
Automata with concurrency relations A are labelled transition systems with a collection of
binary relations indicating when two actions, in a given state of the automaton, are …
binary relations indicating when two actions, in a given state of the automaton, are …
Languages and logical definability in concurrency monoids
M Droste, D Kuske - International Workshop on Computer Science Logic, 1995 - Springer
Abstract Automata with concurrency relations A are labeled transition systems with a
collection of binary relations describing when two actions in a given state of the automaton …
collection of binary relations describing when two actions in a given state of the automaton …
Generalizing finiteness conditions of labelled transition systems
F van Breugel - International Colloquium on Automata, Languages …, 1994 - Springer
In the field of semantics of programming languages, various mathematical structures are
used nowadays. Since the late sixties, complete lattices and complete partial orders play a …
used nowadays. Since the late sixties, complete lattices and complete partial orders play a …
A Kleene theorem for recognizable languages over concurrency monoids
M Droste - International Colloquium on Automata, Languages …, 1994 - Springer
Abstract Automata with concurrency relations A are labelled transition systems with a
collection of binary relations indicating when two events, in a given state of the automaton …
collection of binary relations indicating when two events, in a given state of the automaton …
Aperiodic languages in concurrency monoids
M Droste - information and computation, 1996 - Elsevier
Automata with concurrency relations A are labelled transition systems with a collection of
binary relations indicating when two events, in a given state of the automaton, are …
binary relations indicating when two events, in a given state of the automaton, are …
Dependence orders for computations of concurrent automata
F Bracho, M Droste, D Kuske - STACS 95: 12th Annual Symposium on …, 1995 - Springer
An automaton with concurrency relations A is a labeled transition system with a collection of
binary relations indicating when two events in a given state of the automaton can happen …
binary relations indicating when two events in a given state of the automaton can happen …