19 Hits in 1.9 sec

Bideterministic automata and minimal representations of regular languages

Hellis Tamm, Esko Ukkonen
2004 Theoretical Computer Science  
language is a minimal automaton representation of the language.  ...  Bideterministic automata are deterministic automata with the property of their reversal automata also being deterministic.  ...  Bideterministic automata or bideterministic languages have been considered, for example, in the context of machine learning [1] , as a special case of reversible automata and languages [8] , and in coding  ... 
doi:10.1016/j.tcs.2004.07.010 fatcat:fof6kvzv3jbxjehfse2t34a7rm

Identification of biRFSA languages

Michel Latteux, Aurélien Lemay, Yves Roos, Alain Terlutte
2006 Theoretical Computer Science  
Angluin, also called bideterministic languages as they can be represented by deterministic automata (DFA) whose reverse is also deterministic.  ...  The task of identifying a language from a set of its words is not an easy one. For instance, it is not feasible to identify regular languages in the general case.  ...  of machine learning, or in terms of minimal representation of recognizable languages.  ... 
doi:10.1016/j.tcs.2006.01.029 fatcat:opwz5v6cgfdvjgz3tlzb5l7rgi

Minimal NFA and biRFSA Languages

Michel Latteux, Yves Roos, Alain Terlutte
2008 RAIRO - Theoretical Informatics and Applications  
We prove that every biseparable NFA is uniquely minimal among all NFAs recognizing a same language, improving the result of H. Tamm and E. Ukkonen for bideterministic automata.  ...  We prove that the canonical RFSA of a biRFSA language is a minimal NFA for this language and that each minimal NFA for this language is a sub-automaton of the canonical RFSA.  ...  We are grateful to the referee for comments which helped improve the presentation of this paper.  ... 
doi:10.1051/ita:2008022 fatcat:jiddeu562jctva3ngtnyf67e6y

Page 8150 of Mathematical Reviews Vol. , Issue 2004j [page]

2004 Mathematical Reviews  
to finite automata (49-60); Hellis Tamm and Esko Ukkonen, Bideterministic automata and min- imal representations of regular languages (61-71); Lynette van Zijl, Succinct descriptions of regular languages  ...  Feedback-free circuits in the algebra of tran- sients (106-116); Heiko Kérner, On minimizing cover automata for finite languages in O(n logn) time (117-127); Jorge Grafa, Gloria Andrade and Jesus Vilares  ... 

Nondeterministic Syntactic Complexity [article]

Robert Myers and Stefan Milius and Henning Urbat
2021 arXiv   pre-print
We introduce a new measure on regular languages: their nondeterministic syntactic complexity.  ...  It is the least degree of any extension of the 'canonical boolean representation' of the syntactic monoid. Equivalently, it is the least number of states of any subatomic nondeterministic acceptor.  ...  Tamm, H., Ukkonen, E.: Bideterministic automata and minimal representations of regular languages.  ... 
arXiv:2101.03039v2 fatcat:pbaveaeo6zaurhppdauvq26gmi

Tight Bounds on the Descriptional Complexity of Regular Expressions [chapter]

Hermann Gruber, Markus Holzer
2009 Lecture Notes in Computer Science  
In particular we consider the conversion of planar deterministic finite automata to regular expressions, study the effect of the complementation operation on the descriptional complexity of regular expressions  ...  , and the conversion of regular expressions extended by adding intersection or interleaving to ordinary regular expressions.  ...  Let L be a bideterministic language, and let A be the minimal trim, i.e., without a dead state, deterministic finite automaton accepting L. Then h(L) = cr(A).  ... 
doi:10.1007/978-3-642-02737-6_22 fatcat:zo6ay47qazekvixb2m5flrwlku

Linear cellular automata and Fischer automata

Klaus Sutner
1997 Parallel Computing  
Therefore, the regular languages  ...  For the second measure, one can exploit the fact the the languages L(ρ) are not only regular but also factorial and transitive.  ...  The computational results mentioned in this paper were obtained using automata, a hybrid package of Mathematica and C++ programs written by the author.  ... 
doi:10.1016/s0167-8191(97)00080-x fatcat:xvgcnsdwcffylfojhx5zseb7vi

Learning Residual Finite-State Automata Using Observation Tables

Anna Kasprzik
2010 Electronic Proceedings in Theoretical Computer Science  
We define a two-step learner for RFSAs based on an observation table by using an algorithm for minimal DFAs to build a table for the reversal of the language in question and showing that we can derive  ...  We compare the algorithm to two other table-based ones of which one (by Bollig et al. 2009) infers a RFSA directly, and the other is another two-step learner proposed by the author.  ...  The DFA for a regular language L derived from a closed and consistent table has the minimal number of states (see [1] , Theorem 1).  ... 
doi:10.4204/eptcs.31.23 fatcat:ejpev575evf5rpkvjffa3vsqhy

Syntactic Minimization of Nondeterministic Finite Automata [article]

Robert Samuel Ralph Myers, Henning Urbat
2021 arXiv   pre-print
We also consider the subclass of atomic nondeterministic automata introduced by Brzozowski and Tamm.  ...  We prove that converting a monoid recognizing a regular language into a small subatomic acceptor corresponds to an NP-complete problem.  ...  Note that |J(S ′ )| ≤ |J(S)| because e∶ S ↠ S ′ is surjective. 31 Hellis Tamm and Esko Ukkonen. Bideterministic automata and minimal representations of regular languages.  ... 
arXiv:2107.03229v2 fatcat:osderg5arzh27lcblvyla7izba

On viewing block codes as finite automata

Priti Shankar, Amitava Dasgupta, Kaustubh Deshmukh, B.Sundar Rajan
2003 Theoretical Computer Science  
Necessary and su cient conditions for trellis overlaying are derived from the representation of the block code as a group, partitioned into a subgroup and its cosets.  ...  Block codes are viewed from a formal language theoretic perspective.  ...  Acknowledgements The authors are very grateful to the referee for his careful reading of the manuscript and his useful comments which improved the presentation of the paper.  ... 
doi:10.1016/s0304-3975(02)00083-x fatcat:h75lefwayvaxhclfrz35nkcaja

Succinctness of regular expressions with interleaving, intersection and counting

Wouter Gelade
2010 Theoretical Computer Science  
We also consider the complexity of translations to finite automata.  ...  In this paper, we study the succinctness of regular expressions (REs) extended with interleaving, intersection and counting operators.  ...  Acknowledgements I thank Frank Neven and the reviewer of TCS for helpful suggestions, and Hermann Gruber and Markus Holzer for informing me about their results on the succinctness of the interleaving operator  ... 
doi:10.1016/j.tcs.2010.04.036 fatcat:2h23alsmifgwxpogyybrrso65a

On locally reversible languages

Pedro García, Manuel Vázquez de Parga, Antonio Cano, Damián López
2009 Theoretical Computer Science  
There exist several works that study the class of reversible languages defined as the union closure of 0-reversible languages, their properties and suitable representations.  ...  We also extend the definition of quasi-reversible automata to deal with locally reversible languages and propose a polynomial algorithm to obtain, for any given locally k-reversible language, a quasi-k-reversible  ...  An alternative definition of locally k-testable automata Note that the automaton for the language (τ 2 (L)) r is locally (1, 0)-reversible.  ... 
doi:10.1016/j.tcs.2009.07.009 fatcat:o4g5gyj7wvbczkxcoywumpqjjy

Theme and Variations on the Concatenation Product [chapter]

Jean-Éric Pin
2011 Lecture Notes in Computer Science  
The concatenation product plays a key role in two of the most important results of automata theory: Kleene's theorem on regular languages [23] and Schützenberger's theorem on star-free languages [60] .  ...  The concatenation product is one of the most important operations on regular languages. Its study requires sophisticated tools from algebra, finite model theory and profinite topology.  ...  If L is a lattice of regular languages, then each even level is a lattice of regular languages and each odd level is a Boolean algebra.  ... 
doi:10.1007/978-3-642-21493-6_3 fatcat:2gqznrmyqzbkjbjumq4xf757nm

Syntactic Semigroups [chapter]

Jean-Eric Pin
1997 Handbook of Formal Languages  
Acknowledgements I would like to thank Jorge Almeida, Mario Branco and Pascal Weil for many useful suggestions on a rst version of this chapter.  ...  Now, just as automata can be converted into semigroups, automata with outputs can be converted into matrix representations. In particular, every rational transduction admits a linear representation.  ...  It deals with languages, automata and semigroups, and has connections with model theory in logic, boolean circuits, symbolic dynamics and topology.  ... 
doi:10.1007/978-3-642-59136-5_10 fatcat:yvcpa66flrc6pgfpw5l27yma5q

Page 2300 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
Takeda, Masayuki see Miyamoto, Satoru et al., (2004j:68014) Tamm, Hellis (with Ukkonen, Esko) Bideterministic automata and minimal representa- tions of regular languages.  ...  Surana, Amit (wit/ Ray, Asok) Measure of regular languages. (English summary) 2004m:68 143 Sutner, Klaus Reduced power automata. (English summary) (see 2004j:68013) — The size of power automata.  ... 
« Previous Showing results 1 — 15 out of 19 results