On biautomata∗

Ondřej Klíma; Libor Polák

RAIRO - Theoretical Informatics and Applications (2012)

  • Volume: 46, Issue: 4, page 573-592
  • ISSN: 0988-3754

Abstract

top
We initiate the theory and applications of biautomata. A biautomaton can read a word alternately from the left and from the right. We assign to each regular language L its canonical biautomaton. This structure plays, among all biautomata recognizing the language L, the same role as the minimal deterministic automaton has among all deterministic automata recognizing the language L. We expect that from the graph structure of this automaton one could decide the membership of a given language for certain significant classes of languages. We present the first two results of this kind: namely, a language L is piecewise testable if and only if the canonical biautomaton of L is acyclic. From this result Simon’s famous characterization of piecewise testable languages easily follows. The second class of languages characterizable by the graph structure of their biautomata are prefix-suffix testable languages.

How to cite

top

Klíma, Ondřej, and Polák, Libor. "On biautomata∗." RAIRO - Theoretical Informatics and Applications 46.4 (2012): 573-592. <http://eudml.org/doc/244357>.

@article{Klíma2012,
abstract = {We initiate the theory and applications of biautomata. A biautomaton can read a word alternately from the left and from the right. We assign to each regular language L its canonical biautomaton. This structure plays, among all biautomata recognizing the language L, the same role as the minimal deterministic automaton has among all deterministic automata recognizing the language L. We expect that from the graph structure of this automaton one could decide the membership of a given language for certain significant classes of languages. We present the first two results of this kind: namely, a language L is piecewise testable if and only if the canonical biautomaton of L is acyclic. From this result Simon’s famous characterization of piecewise testable languages easily follows. The second class of languages characterizable by the graph structure of their biautomata are prefix-suffix testable languages.},
author = {Klíma, Ondřej, Polák, Libor},
journal = {RAIRO - Theoretical Informatics and Applications},
keywords = {Biautomata; canonical biautomaton; piecewise testable languages; prefix-suffix languages; biautomata},
language = {eng},
month = {11},
number = {4},
pages = {573-592},
publisher = {EDP Sciences},
title = {On biautomata∗},
url = {http://eudml.org/doc/244357},
volume = {46},
year = {2012},
}

TY - JOUR
AU - Klíma, Ondřej
AU - Polák, Libor
TI - On biautomata∗
JO - RAIRO - Theoretical Informatics and Applications
DA - 2012/11//
PB - EDP Sciences
VL - 46
IS - 4
SP - 573
EP - 592
AB - We initiate the theory and applications of biautomata. A biautomaton can read a word alternately from the left and from the right. We assign to each regular language L its canonical biautomaton. This structure plays, among all biautomata recognizing the language L, the same role as the minimal deterministic automaton has among all deterministic automata recognizing the language L. We expect that from the graph structure of this automaton one could decide the membership of a given language for certain significant classes of languages. We present the first two results of this kind: namely, a language L is piecewise testable if and only if the canonical biautomaton of L is acyclic. From this result Simon’s famous characterization of piecewise testable languages easily follows. The second class of languages characterizable by the graph structure of their biautomata are prefix-suffix testable languages.
LA - eng
KW - Biautomata; canonical biautomaton; piecewise testable languages; prefix-suffix languages; biautomata
UR - http://eudml.org/doc/244357
ER -

References

top
  1. J. Brzozowski, Derivatives of regular expressions. J. ACM11 (1964) 481–494.  
  2. O. Klíma, Piecewise testable languages via combinatorics on words. Disc. Math.311 (2011) 2124–2127.  
  3. O. Klíma and L. Polák, On varieties of meet automata. Theoret. Comput. Sci.407 (2008) 278–289.  
  4. O. Klíma and L. Polák, Hierarchies of piecewise testable languages. Int. J. Found. Comput. Sci.21 (2010) 517–533.  
  5. S. Lombardy and J. Sakarovich, The universal automaton, in Logic and Automata : History and Perspectives, edited by J. Flum, E. Grödel and T. Wilke. Amsterdam University Press (2007) 457–504.  
  6. J.-E. Pin, Varieties of Formal Languages. North Oxford, London and Plenum, New York (1986).  
  7. J.-E. Pin, Syntactic semigroups, in Handbook of Formal Languages, Chap. 10, edited by G. Rozenberg and A. Salomaa. Springer (1997).  
  8. L. Polák, Syntactic semiring and universal automata, in Proc. of DLT 2003. Lect. Notes Comput. Sci.2710 (2003) 411–422.  
  9. I. Simon, Hierarchies of events of dot-depth one. Ph.D. thesis. University of Waterloo (1972).  
  10. I. Simon, Piecewise testable events, in Proc. of ICALP 1975. Lect. Notes Comput. Sci.33 (1975) 214–222.  

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.