Titlebook: Implementation and Application of Automata; 21st International C Yo-Sub Han,Kai Salomaa Conference proceedings 2016 Springer International

Resistance

A Logical Characterization of Small 2NFAsWe prove that automata with polynomially many states are as powerful as formulas with polynomially many clauses and polynomially large constants. This can be seen as a refinement of Immerman’s theorem that nondeterministic logarithmic space matches positive transitive-closure logic (. = .).

ureter

Problems on Finite Automata and the Exponential Time Hypothesisrestricted to unary input alphabets. A different type of problems on finite automata relates to aperiodicity and to synchronizing words. We also consider finite automata that work on commutative alphabets and those working on two-dimensional words.

chassis

A Practical Simulation Result for Two-Way Pushdown Automatares reachable configurations, simulates a class of quasi-deterministic decision problems in linear time even if the pushdown automaton is nondeterministic, and iterates over a simple work list. This is an improvement over previous simulation algorithms.

Lethargic

残忍

Experiments with Synchronizing Automataynchronizing automata, checking them for automata with a small number of states and discussing the results. In particular, we have verified the Černý conjecture for all binary automata with at most 12 states, and all ternary automata with at most 8 states.

刻苦读书

彩色

手段

Organonitrile

characteristic