Q4412574
type: Item
instance of: scholarly article
zbMATH Open document ID: 1015.68525
author: Tamás Gaál
publication date: 2003-07-15T00:00:00Z
full work available at URL: 24940125.htm
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1949651
MaRDI profile type: MaRDI publication profile
Recommended article: Q5418247
Recommended article: Deciding sequentiability of finite-state transducers by finite-state pattern-matching.
Recommended article: Finite State Transducers with Intuition
Recommended article: Finite state transducers with predicates and identities
Recommended article: FINITELY SUBSEQUENTIAL TRANSDUCERS
Recommended article: Are Statecharts Finite Automata?
Recommended article: Q4453201
Recommended article: Inference of finite-state transducers from regular languages
Recommended article: Finite transducers and nondeterministic state complexity of regular languages
Recommended article: Q2753996
description: scientific article; zbMATH DE number 1949651