Titlebook: Automata, Languages and Programming; 14th International C Thomas Ottmann Conference proceedings 1987 Springer-Verlag Berlin Heidelberg 1987

ALIAS

Minimal automaton of a rational cover,ing sense : in every state q, there exists a transition beginning in q and a transition ending in q; furthermore every state is an initial and a final state..We prove here that every rational cover is recognized by a minimal deterministic trimmed automaton Q in the sense of Eilenberg [4] : if . is a

Sad570

A star-height problem in free monoids with partial commutations, if w ε A* contains all letters of A then [w*]={u ε A* | u ∼ w. for some n ≥ 0} is a rational set iff the graph of the complement . of θ is connected. We prove: 1) if θ is not connected then [w*] has starheight one, 2) if θ and . are connected there exist words w ε A* such that [w*] is a rational se

vitrectomy

Libido

On the languages accepted by finite reversible automata,tself. We give four non-trivial characterizations of the languages accepted by a reversible automaton equipped with a set of initial and final states and we show that one can effectively decide whether a given rational (or regular) language can be accepted by a reversible automaton. The first charac

我没有命令

The Common-Neighbors Metric Is Noise-Robust and Reveals Substructures of Real-World Networks978-81-322-1792-3

Host142

预示