Journal ArticleDOI
On deterministic multi pass analysis
Reads0
Chats0
TLDR
Deterministic chains of push-down transducers are introduced as a model of multi-pass compilers and the family is a strict hierarchy ordered by the length of the chain, which strictly includes the Boolean closure of deterministic languages.Abstract:
Chains (or cascade composition) of push-down transducers are introduced as a model of multi-pass compilers. We focus on deterministic chains, since nondeterministic transducer chains of length two define the recursively enumerable sets. Deterministic chains recognize in linear time a superset of context-free deterministic languages. This family is $\mathcal{CH}$ closed under Boolean operations, disjoint shuffle,and reverse deterministic pushdown translation, but not under homomorphism. Equivalent definitions of the family in terms of composition of syntax-directed translation schemes and control languages are considered. The family is a strict hierarchy ordered by the length of the chain. The complexity of $\mathcal{CH}$ is obviously linear, but not all linear-time parsable languages are in $\mathcal{CH}$. On the other hand it strictly includes the Boolean closure of deterministic languages. Finally $\mathcal{CH}$ is not comparable with another classical Boolean algebra of formal languages, namely real-ti...read more
Citations
More filters
Journal ArticleDOI
QRT FIFO automata, breadth-first grammars and their relations
TL;DR: An infinite hierarchy theorem, which contradicts the known results for nondeterministic machines, is proved and a homomorphic characterization of any queue language is presented: L=h(R∩B), where h is a homomorphism (nonerasing if L is QRT), R a regular set and B a BCF language.
Journal ArticleDOI
Descriptional complexity of iterated uniform finite-state transducers
TL;DR: This work introduces the deterministic computational model of an iterated uniform finite-state transducer (iufst), and focuses on non-constant sweep bounded iufsts, showing a nonregular language hierarchy depending on sweep complexity.
Book ChapterDOI
Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power
TL;DR: An iterated uniform finite-state transducer that accepts or rejects the input string by halting in an accepting or rejecting state along its sweeps.
Book ChapterDOI
Descriptional Complexity of Iterated Uniform Finite-State Transducers
TL;DR: In this paper, the authors introduce the deterministic computational model of an iterated uniform finite-state transducer (iufst), which performs the same length-preserving transduction on several left-to-right sweeps.
Book ChapterDOI
Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion
TL;DR: In this article, the authors studied the descriptional costs of removing two-way motion, nondeterminism, and sweeps, and in particular the costs for the conversion to deterministic or non-deterministic finite automata.
Related Papers (5)
Finite-state transducer cascades to extract named entities in texts
Nathalie Friburger,Denis Maurel +1 more
On the average state and transition complexity of finite languages
Hermann Gruber,Markus Holzer +1 more