A New Technique for Reachability of States in Concatenation Automata - Descriptional Complexity of Formal Systems Access content directly
Conference Papers Year : 2018

A New Technique for Reachability of States in Concatenation Automata

Sylvie Davies
  • Function : Author
  • PersonId : 1024581

Abstract

We present a new technique for demonstrating the reachability of states in deterministic finite automata representing the concatenation of two languages. Such demonstrations are a necessary step in establishing the state complexity of the concatenation of two languages, and thus in establishing the state complexity of concatenation as an operation. Typically, ad-hoc induction arguments are used to show particular states are reachable in concatenation automata. We prove some results that seem to capture the essence of many of these induction arguments. Using these results, reachability proofs in concatenation automata can often be done more simply and without using induction directly.
Fichier principal
Vignette du fichier
470153_1_En_7_Chapter.pdf (152.35 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01905633 , version 1 (26-10-2018)

Licence

Attribution

Identifiers

Cite

Sylvie Davies. A New Technique for Reachability of States in Concatenation Automata. 20th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2018, Halifax, NS, Canada. pp.75-87, ⟨10.1007/978-3-319-94631-3_7⟩. ⟨hal-01905633⟩
236 View
43 Download

Altmetric

Share

Gmail Facebook X LinkedIn More