| Publication | Date of Publication | Type |
|---|
Homomorphic definitions of tree languages via comma-free tree codes
Journal of Automata, Languages and Combinatorics | 2025-11-25 | Paper |
Regular languages as images of local functions over small alphabets
Information and Computation | 2024-12-03 | Paper |
From words to pictures: row-column combinations and Chomsky-Schützenberger theorem
Theoretical Computer Science | 2024-06-03 | Paper |
Reducing the local alphabet size in tiling systems by means of 2D comma-free codes
Theoretical Computer Science | 2022-09-27 | Paper |
| Reducing local alphabet size in recognizable picture languages | 2022-03-25 | Paper |
| Homomorphic characterization of tree languages based on comma-free encoding | 2021-10-04 | Paper |
| Commutative languages and their composition by consensual methods | 2021-06-22 | Paper |
Commutative languages and their composition by consensual methods
(available as arXiv preprint) | 2021-06-22 | Paper |
Deque automata, languages, and planar graph representations
Theoretical Computer Science | 2020-08-17 | Paper |
| Regular languages as local functions with small alphabets | 2020-04-29 | Paper |
Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet
Information and Computation | 2019-12-18 | Paper |
| Deque languages, automata and planar graphs | 2018-11-22 | Paper |
Deque languages, automata and planar graphs
(available as arXiv preprint) | 2018-11-22 | Paper |
Counter machines, Petri nets, and consensual computation
Theoretical Computer Science | 2017-03-16 | Paper |
The missing case in Chomsky-Schützenberger theorem
Language and Automata Theory and Applications | 2016-04-13 | Paper |
From regular to strictly locally testable languages
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
From regular to strictly locally testable languages
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
Strict local testability with consensus equals regularity, and other properties
International Journal of Foundations of Computer Science | 2014-03-10 | Paper |
Deterministic counter machines and parallel matching computations
Implementation and Application of Automata | 2013-08-07 | Paper |
From regular to strictly locally testable languages
International Journal of Foundations of Computer Science | 2013-07-30 | Paper |
Strict local testability with consensus equals regularity
Implementation and Application of Automata | 2012-09-20 | Paper |
Consensual languages and matching finite-state computations
RAIRO - Theoretical Informatics and Applications | 2011-06-10 | Paper |
Consensual languages and matching finite-state computations
RAIRO - Theoretical Informatics and Applications | 2011-06-10 | Paper |
Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time
Theoretical Aspects of Computing - ICTAC 2008 | 2009-01-27 | Paper |
Consensual Definition of Languages by Regular Sets
Language and Automata Theory and Applications | 2008-11-20 | Paper |
Model Checking Temporal Metric Specifications with Trio2Promela
Lecture Notes in Computer Science | 2008-07-01 | Paper |
| Regular languages and associative language descriptions | 2008-05-27 | Paper |
Picture languages: tiling systems versus tile rewriting grammars.
Theoretical Computer Science | 2006-05-18 | Paper |
| scientific article; zbMATH DE number 2044500 (Why is no real title available?) | 2004-02-18 | Paper |
Associative language descriptions
Theoretical Computer Science | 2002-03-03 | Paper |
On the relation between multi-depth grammars and tree adjoining grammars
Publicationes Mathematicae Debrecen | 2002-02-13 | Paper |
| scientific article; zbMATH DE number 1693485 (Why is no real title available?) | 2002-01-22 | Paper |
Associative definition of programming languages
Computer Languages | 2001-11-08 | Paper |
Tree adjoining languages and multipushdown languages
Theory of Computing Systems | 2000-12-07 | Paper |
| scientific article; zbMATH DE number 1507233 (Why is no real title available?) | 2000-09-14 | Paper |
| scientific article; zbMATH DE number 1254092 (Why is no real title available?) | 1999-10-25 | Paper |
| scientific article; zbMATH DE number 1972805 (Why is no real title available?) | 1999-01-01 | Paper |
A polynomial-time parsing algorithm for \(K\)-depth languages
Journal of Computer and System Sciences | 1996-07-16 | Paper |
Embedding time granularity in a logical specification language for synchronous real-time systems
Science of Computer Programming | 1993-10-17 | Paper |
