Finite-valued distance automata
Reads0
Chats0
TLDR
It is decidable in deterministic double exponential time whether two given finite-valued distance automata are equivalent, i.e., every input word has the same distance in both machines.About:
This article is published in Theoretical Computer Science.The article was published on 1994-11-07 and is currently open access. It has received 37 citations till now. The article focuses on the topics: Deterministic automaton & Two-way deterministic finite automaton.read more
Citations
More filters
Book ChapterDOI
Semirings and formal power series: their relevance to formal languages and automata
TL;DR: The purpose of Chapter 9 is to develop some classical results on formal languages and automata by an algebraic treatment using semirings, formal power series and matrices.
Journal ArticleDOI
Performance evaluation of (max,+) automata
TL;DR: This formalism, which extends both conventional automata and (max,+) linear representations, covers a class of systems with synchronization phenomena and variable schedules and considers performance evaluation in the worst, mean, and optimal cases.
Book ChapterDOI
The Theory of Stabilisation Monoids and Regular Cost Functions
TL;DR: The notion of regular cost functions is introduced: a quantitative extension to the standard theory of regular languages, and a suitable notion of recognisability by stabilisation monoids is provided, and closure and decidability results are provided.
Proceedings ArticleDOI
Regular Functions and Cost Register Automata
TL;DR: A deterministic model for associating costs with strings that is parameterized by operations of interest, a notion of regularity that provides a yardstick to measure expressiveness, and decision problems and theoretical properties of resulting classes of cost functions are proposed.
Journal ArticleDOI
Distance desert automata and the star height problem
TL;DR: It is shown that it is decidable in time complexity whether the language accepted by an n-state non-deterministic automaton is of star height one, which is the first ever complexity result for the star heightOne problem.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Journal ArticleDOI
The equality problem for rational series with multiplicities in the tropical semiring is undecidable
TL;DR: HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not.
Journal ArticleDOI
Limitedness theorem on finite automata with distance functions
TL;DR: There exists an algorithm for deciding whether or not an arbitrary finite automaton with a distance function is limited in distance, and it is shown that this paper shows that this algorithm is available.
Book ChapterDOI
Recognizable Sets with Multiplicities in the Tropical Semiring
TL;DR: The last ten years saw the emergence of some results about recognizable subsets of a free monoid with multiplicities in the Min-Plus semiring that were motivated throughout by applications such as the finite power property, Eggan's classical star height problem and the measure of the nondeterministic complexity of finite automata.