Old Web
English
Sign In
Acemap
>
Paper
>
Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination.
Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination.
2020
Tomáš Pecka
Jan Trávníček
Jan Janoušek
Keywords:
Automaton
Discrete mathematics
regular tree
finite tree
Expression (mathematics)
Mathematics
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]