Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19162801

Regularity problems for visibly pushdown languages

Author
BARANY, Vince1 ; LÖDING, Christof1 ; SERRE, Olivier2
[1] RWTH Aachen, Germany
[2] LIAFA, Université Paris VII & CNRS, France
Conference title
STACS 2006 (23rd annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006)
Conference name
Symposium on Theoretical Aspects of Computer Science (23 ; Marseille 2006)
Author (monograph)
Durand, Bruno (Editor); Thomas, Wolfgang (Editor)
Source

Lecture notes in computer science. 2006 ; 1Vol, pp 420-431, 12 p ; ref : 16 ref

ISSN
0302-9743
ISBN
3-540-32301-5
Scientific domain
Computer science
Publisher
Springer, Berlin / Springer, New York
Publication country
Germany
Document type
Conference Paper
Language
English
Keyword (fr)
Alphabet Automate fini Automate à pile Décidabilité Informatique théorique Langage rationnel Partition Pile mémoire Régularité
Keyword (en)
Alphabet Finite automaton Push down automaton Decidability Computer theory Regular language Partition Stack Regularity
Keyword (es)
Alfabeto Autómata estado finito Autómata a pila Decidibilidad Informática teórica Lenguaje racional Partición Pila Regularidad
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics

Discipline
Computer science : theoretical automation and systems
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
19162801

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web