6533b7dcfe1ef96bd1271d3f

RESEARCH PRODUCT

Local automata and completion

Rosa Montalbano

subject

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESNested wordTheoretical computer scienceComputer scienceTimed automatonω-automatonNonlinear Sciences::Cellular Automata and Lattice GasesTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESDeterministic finite automatonDFA minimizationAutomata theoryQuantum finite automataNondeterministic finite automatonComputer Science::Formal Languages and Automata Theory

description

The problem of completing a finite automata preserving its properties is here investigated in the case of deterministic local automata. We show a decision procedure and give an algorithm which complete a deterministic local automaton (if the completion exists) with another one, having the same number of states.

yearjournalcountryeditionlanguage
1993-01-01
https://doi.org/10.1007/3-540-56503-5_34