Titlebook: Implementation and Application of Automata; 7th International Co Jean-Marc Champarnaud,Denis Maurel Conference proceedings 2003 Springer-Ve

Hypomania

Finite Automata and Non-self-Embedding Grammarsn in terms of composition of regular grammars and state relationships between NSE grammars and push-down automata. Finally we show a polynomial algorithm to decide whether a context-free grammars is self-embedding or not.

reptile

Simulation of Gate Circuits in the Algebra of Transientsecting hazards.We study two simulation algorithms: a general one, A, that works with any state, and ?, that applies if the initial state is stable.We show that the two algorithms agree in the stable case. We prove the sufficiency of the simulation: all signal changes occurring in binary analysis are also predicted by Algorithm A.

HAUNT

Ingest

Feedback-Free Circuits in the Algebra of Transientsinary analysis. For any feedback-free circuit consisting of 1- and 2-input gates and started in a stable state, we prove that all signal changes predicted by simulation occur in binary analysis, provided that wire delays are taken into account. Two types of finite automata play an important role in our proof.

性上癮

Fatten

山頂可休息

Efficient Automaton-Based Recognition for Linear Conjunctive Languagestomata: while the former are better suited for human use, the latter are considerably easier to implement. In this paper, an algorithm for converting an arbitrary linear conjunctive grammar to an equivalent automaton is proposed, and different techniques of reducing the size of existing automata are studied.

有抱負(fù)者

-Subsequentiable Transducers. The theoretical formulation of our results is the equivalence of the following three properties for finite-state transducers: determinizability in the sense of the generalized algorithm, .-subsequentiability, and the twins property.

一大塊

MOCK