automaton.realtime

Compute the realtime automaton, i.e. the equivalent automaton in which transitions are labeled with only letters (as viewed by the labelset), without spontaneous transitions.

Calling realtime is equivalent to calling letterize then proper.

Preconditions:

The automaton is_valid

Postconditions:

The automaton is_letterized
The automaton is_proper

Examples



In [1]:

    
import vcsn









    



:0: FutureWarning: IPython widgets are experimental and may change in the future.



In [2]:

    
law = vcsn.context("law_char, b")



In [3]:

    
a = law.expression("(ab)*+(cd+ef)*").thompson()
a









    Out[3]:



In [4]:

    
a.is_valid()









    Out[4]:





True



In [5]:

    
a.is_letterized()









    Out[5]:





False



In [6]:

    
a.is_proper()









    Out[6]:





False



In [7]:

    
r = a.realtime()
r









    Out[7]:



In [8]:

    
r.context()









    Out[8]:





$\{a, b, c, d, e, f\}\rightarrow\mathbb{B}$



In [9]:

    
r.is_letterized()









    Out[9]:





True



In [10]:

    
r.is_proper()









    Out[10]:





True



In [11]:

    
a.letterize().proper()









    Out[11]: