Results 1 to 10 of about 4,399 (316)

A prolog toolkit for formal languages and automata [PDF]

open access: yesACM SIGCSE Bulletin, 2005
This paper describes the first version of PFLAT (read "P flat"), a collection of Prolog predicates that aims to provide a pedagogical implementation of concepts and algorithms taught in Formal Languages and Automata Theory (FLAT) courses. By ``pedagogical implementation'' we mean on the one hand that students should be able to easily map the ...
Wermelinger, Michel, Dias, Artur Miguel
openaire   +3 more sources

A bialgebraic approach to automata and formal language theory [PDF]

open access: greenAnnals of Pure and Applied Logic, 2008
29 pages, fixed typos, added ...
James Worthington
openaire   +4 more sources

Proceedings 14th International Conference on Automata and Formal Languages

open access: diamond, 2014
The 14th International Conference Automata and Formal Languages (AFL 2014) was held in Szeged, Hungary, from the 27th to the 29th of May, 2014. The conference was organized by the Department of Foundations of Computer Science of the University of Szeged. Topics of interest covered the theory and applications of automata and formal languages and related
��sik, Zolt��n   +1 more
  +6 more sources

Proceedings 15th International Conference on Automata and Formal Languages

open access: diamondElectronic Proceedings in Theoretical Computer Science, 2017
The 15th International Conference on Automata and Formal Languages (AFL 2017) was held in Debrecen, Hungary, from September 4 to 6, 2017. The conference was organized by the Faculty of Informatics of the University of Debrecen and the Faculty of Informatics of the E\"otv\"os Lor\'and University of Budapest.
Erzsébet Csuhaj-Varjú   +2 more
  +6 more sources

Workshop on Formal Languages, Automata and Petri Nets

open access: green, 1998
This report contains abstracts of the lectures presented at the workshop 'Formal Languages, Automata and Petri-Nets' held at the University of Stuttgart on January 16-17, 1998. The workshop brought together partners of the German-Hungarian project No. 233.6, Forschungszentrum Karlsruhe, Germany, and No. D/102, TeT Foundation, Budapest, Hungary.
Holger Petersen
openaire   +4 more sources

Resynchronized Uniformization and Definability Problems for Rational Relations [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2023
Regular synchronization languages can be used to define rational relations of finite words, and to characterize subclasses of rational relations, like automatic or recognizable relations.
Christof Löding, Sarah Winter
doaj   +1 more source

Home - About - Disclaimer - Privacy