An automata-theoretical characterization of context-free trace languages

Authors:
Benedek Nagy;Friedrich Otto
Affiliations:
Department of Computer Science, Faculty of Informatics, University of Debrecen, Debrecen, Hungary;Fachbereich Elektrotechnik, Informatik, Universität Kassel, Kassel, Germany
Venue:
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Year:
2011

Citing 7
Cited 1

Theory of traces

Theoretical Computer Science
Membership problems for regular and context-free trace languages

Information and Computation
Context-free languages and pushdown automata

Handbook of formal languages, vol. 1
The Book of Traces

The Book of Traces
Simulation Problems for One-Counter Machines

SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Input reversals and iterated pushdown automata: a new characterization of khabbaz geometric hierarchy of languages

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
CD-systems of stateless deterministic r(1)-automata accept all rational trace languages

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications

On restarting automata with window size one

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a characterization of the class of context-free trace languages in terms of cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 that are governed by an external pushdown store.